Revisiting the convergence theorem for competitive bidding in common value auctions (Q2099326)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Revisiting the convergence theorem for competitive bidding in common value auctions |
scientific article; zbMATH DE number 7622453
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisiting the convergence theorem for competitive bidding in common value auctions |
scientific article; zbMATH DE number 7622453 |
Statements
Revisiting the convergence theorem for competitive bidding in common value auctions (English)
0 references
23 November 2022
0 references
In this article, the authors provide an alternative condition and an alternative proof for the convergence theorem of competitive bidding in a special class of common value auctions which is introduced by \textit{J. Bulow} and \textit{P. Klemperer} [Prices and the winner's curse. Working Paper. Stanford Graduate School of Business (1997)] and called wallet games, and obtain a positive result in the sense that the convergence result holds even when Milgrom's condition is not satisfied. This paper extends [\textit{R. Wilson}, Rev. Econ. Stud. 44, 511--518 (1977; Zbl 0373.90012)] and [\textit{P. R. Milgrom}, Econometrica 47, 679--688 (1979; Zbl 0415.90100)] to situations to which their conditions cannot be applied, although its apparent limitation is that it cannot be applied to general common value auctions which are not wallet games. It is shown (see Theorem 1): In a wallet game with \(E[X_i]=\nu(<\infty)\) where \(\nu\) is known \[ W_n-V_n \stackrel{p}{\longrightarrow}O \] where \(W_n=\max\{b(X_1;n),\ldots , b(X_n;n)\}\) and \(V_n=\frac{\sum_{i=1}^nX_i}{n}\).
0 references
auction
0 references
common value
0 references
convergence theorem
0 references
winner's curse
0 references
0.7337194681167603
0 references
0.7173964977264404
0 references
0.7135316133499146
0 references