# The Loser's Curse and Information Aggregation in Common Value Auctions

https://doi.org/0012-9682(199711)65:6<1247:TLCAIA>2.0.CO;2-J
p. 1247-1281

Jeroen M. Swinkels, Wolfgang Pesendorfer

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.