We 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 + 1$st bid. Bidders receive a signal that provides information about the value of the object. We characterize the unique symmetric equilibrium of this auction. We then consider a sequence of auctions $A_r$ with $n_r$ bidders and $k_r$ objects. We show that price converges in probability to the true value of the object if and only if both $k_r \rightarrow \infty$ and $n_r - k_r \rightarrow \infty$, i.e., both the number of objects and the number of bidders who do not receive an object go to infinity.
MLA
Swinkels, Jeroen M., and Wolfgang Pesendorfer. “The Loser's Curse and Information Aggregation in Common Value Auctions.” Econometrica, vol. 65, .no 6, Econometric Society, 1997, pp. 1247-1281, https://www.jstor.org/stable/2171736
Chicago
Swinkels, Jeroen M., and Wolfgang Pesendorfer. “The Loser's Curse and Information Aggregation in Common Value Auctions.” Econometrica, 65, .no 6, (Econometric Society: 1997), 1247-1281. https://www.jstor.org/stable/2171736
APA
Swinkels, J. M., & Pesendorfer, W. (1997). The Loser's Curse and Information Aggregation in Common Value Auctions. Econometrica, 65(6), 1247-1281. https://www.jstor.org/stable/2171736
The Executive Committee of the Econometric Society has approved an increase in the submission fees for papers in Econometrica. Starting January 1, 2025, the fee for new submissions to Econometrica will be US$125 for regular members and US$50 for student members.
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.