Home /  Workshop /  Schedules /  The Costly Wisdom of Inattentive Crowds

The Costly Wisdom of Inattentive Crowds

Introductory Workshop: Mathematics and Computer Science of Market and Mechanism Design September 11, 2023 - September 15, 2023

September 12, 2023 (02:00 PM PDT - 03:00 PM PDT)
Speaker(s): Ilya Segal (Stanford University)
Location: SLMath: Eisenbud Auditorium, Online/Virtual
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

The Costly Wisdom of Inattentive Crowds

Abstract

Incentivizing the acquisition and aggregation of information is a key task of the modern economy (e.g., financial markets, prediction markets, auctions, organizations). The talk will discuss the design of optimal mechanisms for this task. I assume that agents are rationally inattentive (RI), i.e., engage in costly flexible information acquisition subject to uniformly posterior separable (UPS) information costs. A principal aims to procure a given information structure from one or many the agents at a minimal cost by designing design general dynamic mechanisms with report- and state-contingent payments. If the agents are risk-neutral, prediction markets implement the first-best. If the agents are risk-averse, no mechanism can approximate the first-best cost—not even those that harness the “wisdom of the crowd” by employing a large number of “informationally small” agents. This inefficiency derives from the combination of agents’ moral hazard and adverse selection. Our characterization of incentive compatibility, which exploits an equivalence between proper scoring rules and UPS information costs, is tractable and portable to other design settings with RI agents (e.g., principal-expert and screening problems).

Based on joint work with Alex Bloedel.

Supplements No Notes/Supplements Uploaded
Video/Audio Files

The Costly Wisdom of Inattentive Crowds

Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.