Information aggregation in auctions with an unknown number of bidders

Ronald M. Harstad (), Aleksandar Sasa Pekec and Ilia Tsetlin

Games and Economic Behavior, 2008, vol. 62, issue 2, pages 476-508

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.

Downloads: (external link)
http://www.sciencedirect.com/science/article/B6WFW ... 394d5969810420a690e4
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Information Aggregation in Auctions with an Unknown Number of Bidders (2005)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Access Statistics for this article

Games and Economic Behavior is edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Series data maintained by Heidi Boesdal ().