Advanced Search
MyIDEAS: Login to save this article or follow this journal

Information aggregation in auctions with an unknown number of bidders

Contents:

Author Info

  • Harstad, Ronald M.
  • Pekec, Aleksandar Sasa
  • Tsetlin, Ilia

Abstract

Information aggregation, a key concern for uniform-price, common-value auctions with many bidders, has been characterized in models where bidders know exactly how many rivals they face. A model allowing for uncertainty over the number of bidders is essential for capturing a critical condition for information to aggregate: as the numbers of winning and losing bidders grow large, information aggregates if and only if uncertainty about the fraction of winning bidders vanishes. It may be possible for the seller to impart this information by precommitting to a specified fraction of winning bidders, via a proportional selling policy. Intuitively, this could make the proportion of winners known, and thus provide all the information that bidders need to make winner's curse corrections.

Download Info

If 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.
File URL: http://www.sciencedirect.com/science/article/B6WFW-4P6VDFS-1/1/979e06e6ce14394d5969810420a690e4
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 62 (2008)
Issue (Month): 2 (March)
Pages: 476-508

as in new window
Handle: RePEc:eee:gamebe:v:62:y:2008:i:2:p:476-508

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

References

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.:
as in new window
  1. Paul Klemperer, 1999. "Auction Theory: A Guide to the Literature," Microeconomics 9903002, EconWPA.
  2. Rothkopf, Michael H & Harstad, Ronald M, 1995. "Two Models of Bid-Taker Cheating in Vickrey Auctions," The Journal of Business, University of Chicago Press, vol. 68(2), pages 257-67, April.
  3. Riley, John G, 1988. "Ex Post Information in Auctions," Review of Economic Studies, Wiley Blackwell, vol. 55(3), pages 409-29, July.
  4. Wolfgang Pesendorfer & Jeroen M. Swinkels, 1995. "The Loser's Curse and Information Aggregation in Common Value Auctions," Discussion Papers 1147, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  5. Milgrom, Paul R, 1979. "A Convergence Theorem for Competitive Bidding with Differential Information," Econometrica, Econometric Society, vol. 47(3), pages 679-88, May.
  6. Ilan Kremer, 2002. "Information Aggregation in Common Value Auctions," Econometrica, Econometric Society, vol. 70(4), pages 1675-1682, July.
  7. Harstad, Ronald M. & Kagel, John H. & Levin, Dan, 1990. "Equilibrium bid functions for auctions with an uncertain number of bidders," Economics Letters, Elsevier, vol. 33(1), pages 35-40, May.
  8. Matthews, Steven, 1987. "Comparing Auctions for Risk Averse Buyers: A Buyer's Point of View," Econometrica, Econometric Society, vol. 55(3), pages 633-46, May.
  9. Milgrom, Paul R, 1981. "Rational Expectations, Information Acquisition, and Competitive Bidding," Econometrica, Econometric Society, vol. 49(4), pages 921-43, June.
  10. Hong, Han & Shum, Matthew, 2004. "Rates of information aggregation in common value auctions," Journal of Economic Theory, Elsevier, vol. 116(1), pages 1-40, May.
  11. Wilson, Robert, 1977. "A Bidding Model of Perfect Competition," Review of Economic Studies, Wiley Blackwell, vol. 44(3), pages 511-18, October.
  12. 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.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Bos, Olivier, 2012. "Wars of attrition and all-pay auctions with stochastic competition," Journal of Mathematical Economics, Elsevier, vol. 48(2), pages 83-91.
  2. Ronald M. Harstad, 2009. "Does a Seller Really Want Another Bidder?," Working Papers 0909, Department of Economics, University of Missouri.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:62:y:2008:i:2:p:476-508. 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: (Zhang, Lei).

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.