Neeman (2004) and Heifetz and Neeman (2006) have shown that, in auctions with incomplete information about payoffs, full surplus extraction is only possible if agents’ beliefs about other agents are fully informative about their own payoff parameters. They argue that the set of...

This paper studies the optimal mechanisms for a seller with imperfect commitment who puts up for sale one individual unit per period to a single buyer in a dynamic game. The buyer's willingness to pay remains constant over time and is his private information. In this setting, the seller cannot...

In mechanism design with (partially) verifiable information, the revelation principle holds if allocations are modelled as the Cartesian product of outcomes and verifiable information, giving rise to evidence-contingent mechanisms. Consequently, incentive constraints characterize the...

I study a persuasion game between a privately informed agent and a decision maker (DM) who can imperfectly verify the statements made by the agent by observing a signal that is correlated with the agent's information. I find that whether or not the DM benefits from communicating with the agent...

I consider a seller selling a good to bidders with two-dimensional private information: their valuation for a good and their characteristic. While valuations are non-verifiable, characteristics are partially verifiable and convey information about the distribution of a bidder’s valuation. I...

We consider robust virtual implementation, where robustness is the requirement that implementation succeed in all type spaces consistent with a given payoff type space as well as with a given space of first-order beliefs about the other agents’ payoff types. This last bit, which constitutes...

Suppose that the goals of a society can be summarized in a social choice rule, i.e., a mapping from relevant underlying parameters to final outcomes. Typically, the underlying parameters (e.g., individual preferences) are private information to the agents in society. The implementation problem...

Implementation in iteratively undominated strategies relies on permissive conditions. However, for the sufficiency results available, authors have relied on assumptions that amount to quasilinear preferences on a numeraire. We uncover a new necessary condition that implies that such assumptions...

For an incomplete-information model of public-good provision with interim participation constraints, we show that efficient outcomes can be approximated, with approximately full surplus extraction, when there are many agents and each agent is informationally small. The result holds even if...

We analyze the canonical nonlinear pricing model with limited information. A seller offers a menu with a finite number of choices to a continuum of buyers with a continuum of possible valuations. By revealing an underlying connection to quantization theory, we derive the optimal finite menu for...