Efficient Auctions and Interdependent Types

$19.00 plus tax (Refund Policy)

Buy Article:

Abstract:

We consider the efficient allocation of a single good with interdependent values in a quasilinear environment. We present an approach to modeling interdependent preferences distinguishing between “payoff types” and “belief types” and report a characterization of when the efficient allocation can be partially Bayesian implemented on a finite type space. The characterization can be used to unify a number of sufficient conditions for efficient partial implementation in this classical auction setting. We report how a canonical language for discussing interdependent types - developed in a more general setting by Bergemann, Morris and Takahashi (2011) - applies in this setting and note by example that this canonical language will not allow us to distinguish some types in the payoff type - belief type language.

Document Type: Research Article

DOI: http://dx.doi.org/10.1257/aer.102.3.319

Publication date: May 1, 2012

More about this publication?
Related content

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more