AbstractWe 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
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by MIT Press in its journal The Quarterly Journal of Economics.
Volume (Year): 115 (2000)
Issue (Month): 2 (May)
Contact details of provider:
Web page: http://mitpress.mit.edu/journals/
Other versions of this item:
- P. Dasgupta & Eric Maskin, 1998. "Efficient Auctions," Harvard Institute of Economic Research Working Papers 1857, Harvard - Institute of Economic Research.
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Karie Kirkpatrick).
If references are entirely missing, you can add them using this form.