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...

McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in models with a continuum of types. We interpret their condition as significantly stronger version of the requirement of injectiveness of the function mapping abstract types into beliefs and prove...

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...

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...

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...

McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in models with a continuum of types. We interpret their condition as significantly stronger version of the requirement of injectiveness of the function mapping abstract types into beliefs and prove...

McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in naive type spaces with a continuum of payoff types. We generalize their characterization to arbitrary abstract type spaces and to the universal type space and show that in each setting, full...

McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in naive type spaces with a continuum of payoff types. We generalize their characterization to arbitrary abstract type spaces and to the universal type space and show that in each setting, full...

We introduce intention-based social preferences into mechanism design. We explore information structures that dier with respect to what is commonly known about the weight that agents attach to reciprocal kindness. When the designer has no information on reciprocity types, implementability of an...

We study the relation between mechanism design and voting in public-good provision. If incentive mechanisms must satisfy conditions of coalition-proofness and robustness, as well as individual incentive compatibility, the participants' contributions to public-good provision can only depend on...