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

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

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

This paper studies collusion in one-shot auctions, where a buyer can bribe his competitors into lowering their bids. We modify the single-unit Vickrey auction to incite deviations from the designated-winner scenario and thus undermine collusion. The construction of mechanism does not require the...

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

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

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 collusion in one-shot auctions, where a buyer can bribe his competitors into lowering their bids. We modify the single-unit Vickrey auction to incite deviations from the designated-winner scenario and thus undermine collusion. The construction of mechanism does not require the...

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