The Loser's Curse and Information Aggregation in Common Value Auctions
The authors consider an auction in which k identical objects of unknown value are auctioned off to n bidders. The k highest bidders get an object and pay the k + 1st bid. Bidders receive a signal that provides information about the value of the object. The authors characterize the unique symmetric equilibrium of this auction. They then consider a sequence of auctions A[subscript]r with n[subscript]r bidders and k[subscript]r objects. The authors show that price converges in probability to the true value of the object if and only if both the number of objects (k) and the number of bidders who do not receive an object (n - k) go to infinity.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 65 (1997)
Issue (Month): 6 (November)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |
References listed on IDEAS
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.:
- Milgrom, Paul R & Weber, Robert J, 1982.
"A Theory of Auctions and Competitive Bidding,"
Econometric Society, vol. 50(5), pages 1089-1122, September.
- Robert Wilson, 1977. "A Bidding Model of Perfect Competition," Review of Economic Studies, Oxford University Press, vol. 44(3), pages 511-518.
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:65:y:1997:i:6:p:1247-1282. 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: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
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.