首页 | 本学科首页   官方微博 | 高级检索  
     


Information aggregation in auctions with an unknown number of bidders
Authors:Ronald M. Harstad, Aleksandar Sa&#x  a Peke   ,Ilia Tsetlin
Affiliation:aEconomics Department, University of Missouri, Columbia, MO 65211, USA;bThe Fuqua School of Business, Duke University, Durham, NC 27708-0120, USA;cINSEAD, 1 Ayer Rajah Avenue, 138676 Singapore
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.
Keywords:Information aggregation   Common-value auctions   Uncertain level of competition
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号