We exhibit an efficient auction (an auction that maximizes surplus conditional on all available information). For private values, the Vickrey auction (for one good) or its Groves-Clarke extension (for multiple goods) is efficient. We show that the Vickrey and Groves-Clarke auctions can be generalized to attain efficiency when there are common values, if each buyer's information can be represented as a one-dimensional signal. When a buyer's information is multidimensional, no auction is generally efficient. Nevertheless, in a broad class of cases, our auction is constrained-efficient in the sense of being efficient subject to incentive constraints. © 2000 the President and Fellows of Harvard College and the Massachusetts Institute of Technology
Volume (Year): 115 (2000)
Issue (Month): 2 (May)
|Contact details of provider:|| Web page: http://mitpress.mit.edu/journals/|
|Order Information:||Web: http://mitpress.mit.edu/journal-home.tcl?issn=00335533|
When requesting a correction, please mention this item's handle: RePEc:tpr:qjecon:v:115:y:2000:i:2:p:341-388. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anna Pollock-Nelson)
If references are entirely missing, you can add them using this form.