Information aggregation in auctions with an unknown number of bidders
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.
Year of publication: |
2008
|
---|---|
Authors: | Harstad, Ronald M. ; Pekec, Aleksandar Sasa ; Tsetlin, Ilia |
Published in: |
Games and Economic Behavior. - Elsevier, ISSN 0899-8256. - Vol. 62.2008, 2, p. 476-508
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Sequential vs. single-round uniform-price auctions
Mezzetti, Claudio, (2008)
-
Revenue Ranking of Discriminatory and Uniform Auctions with an Unknown Number of Bidders
Pekec, Aleksandar Sasa, (2008)
-
Information Aggregation in Auctions with an Unknown Number of Bidders
Harstad, Ronald M., (2005)
- More ...