We study how the outcomes of a private-value first price auction can vary with bidders' information, for a fixed distribution of private values. In a two bidder, two value, setting, we characterize all combinations of bidder surplus and revenue that can arise, and identify the information...

We characterize the profit-maximizing mechanism for repeatedly selling a non-durable good in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his...

We characterize the revenue-maximizing mechanism for time separable allocation problems in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his...

We characterize the profit-maximizing mechanism for repeatedly selling a non-durable good in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his...

This note constructs an efficient mechanism for finding the best candidate for a committee from a sequence of potential candidates. Committee members have independent private values information about the quality of the candidate. The mechanism selects the best candidate according to the standard...

In this paper we study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^{U}(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an...

We analyze nonlinear pricing with finite information. A seller offers a menu to a continuum of buyers with a continuum of possible valuations. The menu is limited to offering a finite number of choices representing a finite communication capacity between buyer and seller. We identify necessary...

We analyze a nonlinear pricing model with limited information. Each buyer can purchase a large variety, d, of goods. His preference for each good is represented by a scalar and his preference over d goods is represented by a d-dimensional vector. The type space of each buyer is given by a...

This paper studies the design of a recommender system for organizing social learning on a product. To improve incentives for early experimentation, the optimal design trades off fully transparent social learning by over-recommending a product (or “spamming”) to a fraction of agents in the...

A social choice function is robustly implemented if every equilibrium on every type space achieves outcomes consistent with it. We identify a robust monotonicity condition that is necessary and (with mild extra assumptions) sufficient for robust implementation. Robust monotonicity is strictly...