Information Revelation and Efficiency in Auctions
We study the impact of information revelation on effciency in auctions. In a constrained-efficient mechanism, i.e. a mechanism that is efficient subject to the incentivecompatibility constraint, any additional information available to bidders increases the expected efficiency of the mechanism. This result cannot be extended to a more general setup: in a second-price sealed bid auction, revelation of information might lead to efficiency losses.
|Date of creation:||Jun 2002|
|Contact details of provider:|| Postal: 117418 Russia, Moscow, Nakhimovsky pr., 47, office 720|
Phone: +7 (495) 105 50 02
Fax: +7 (495) 105 50 03
Web page: http://www.cefir.ru
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jacob K. Goeree & Theo Offerman, 2003.
"Competitive Bidding in Auctions with Private and Common Values,"
Royal Economic Society, vol. 113(489), pages 598-613, 07.
- Jacob K. Goeree & Theo Offerman, 1999. "Competitive Bidding in Auctions with Private and Common Values," Virginia Economics Online Papers 337, University of Virginia, Department of Economics.
- Jacob K. Goeree & Theo Offerman, 2000. "Competitive Bidding in Auctions with Private and Common Values," Tinbergen Institute Discussion Papers 00-044/1, Tinbergen Institute.
- Holmstrom, Bengt & Myerson, Roger B, 1983. "Efficient and Durable Decision Rules with Incomplete Information," Econometrica, Econometric Society, vol. 51(6), pages 1799-1819, November.
- Bengt Holmstrom & Roger B. Myerson, 1981. "Efficient and Durable Decision Rules with Incomplete Information," Discussion Papers 495, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
- Paul Milgrom & Robert J. Weber, 1981. "A Theory of Auctions and Competitive Bidding," Discussion Papers 447R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Krishna, Vijay, 2009. "Auction Theory," Elsevier Monographs, Elsevier, edition 2, number 9780123745071.
- Krishna, Vijay, 2002. "Auction Theory," Elsevier Monographs, Elsevier, edition 1, number 9780124262973.
- Engelbrecht-Wiggans, Richard & Milgrom, Paul R. & Weber, Robert J., 1983. "Competitive bidding and proprietary information," Journal of Mathematical Economics, Elsevier, vol. 11(2), pages 161-169, April.
- Partha Dasgupta & Eric Maskin, 2000. "Efficient Auctions," The Quarterly Journal of Economics, Oxford University Press, vol. 115(2), pages 341-388.
- P. Dasgupta & Eric Maskin, 1998. "Efficient Auctions," Harvard Institute of Economic Research Working Papers 1857, Harvard - Institute of Economic Research.
When requesting a correction, please mention this item's handle: RePEc:cfr:cefirw:w0021. 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: (Julia Babich)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.