TY - JOUR

T1 - Asymptotic efficiency for discriminatory private value auctions

AU - Swinkels, Jeroen M.

N1 - Funding Information:
Consider choosing both iE {I, ... , n} and hE {I, ... m}, at random. Then, by (A4), there is n* < 00 such that for n > n*, vi(h) is above v* = (r + v)/2 with probability at least M(v- v*)/m, and so E(vih) is at least M(v- v*)v*/ m=:t;. If objects are randomly allocated across both players and units of demand, then expected surplus is at least knt;. Since under efficient allocation, the k" objects go to the k" highest values, E(r) is at least this amount, and we are done. II Acknowledgements. I thank Eddie Dekel, Elchanan Ben-Porath, Joseph Harrington, Peter KlibanofT, Roger Myerson, Hyun Song Shin, Bob Weber, and three referees for helpful comments. Tianxiang Ye provided helpful comments and assistance in preparing the manuscript. I also thank seminar audiences at the University of Iowa, Johns Hopkins University, the University of Wisconsin, Northwestern University, the University of British Columbia and the Stony Brook Summer Game Theory workshop. Financial support from the NSF is gratefully acknowledged.

PY - 1999/7

Y1 - 1999/7

N2 - We consider discriminatory auctions for multiple identical units of a good. Players have private values, possibly for multiple units. None of the usual assumptions about symmetry of players' distributions over values or symmetry of equilibrium play are made. Because of this, equilibria will typically involve inefficient allocations. Equilibria also become very difficult to solve for. Using an approach which does not depend on explicit equilibrium calculations we show that such auctions become arbitrarily close to efficient as the number of players, and possibly the number of objects, grows large, and provide a simple characterization of limit equilibria.

AB - We consider discriminatory auctions for multiple identical units of a good. Players have private values, possibly for multiple units. None of the usual assumptions about symmetry of players' distributions over values or symmetry of equilibrium play are made. Because of this, equilibria will typically involve inefficient allocations. Equilibria also become very difficult to solve for. Using an approach which does not depend on explicit equilibrium calculations we show that such auctions become arbitrarily close to efficient as the number of players, and possibly the number of objects, grows large, and provide a simple characterization of limit equilibria.

UR - http://www.scopus.com/inward/record.url?scp=0000157425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000157425&partnerID=8YFLogxK

U2 - 10.1111/1467-937X.00096

DO - 10.1111/1467-937X.00096

M3 - Article

AN - SCOPUS:0000157425

VL - 66

SP - 509

EP - 528

JO - Review of Economic Studies

JF - Review of Economic Studies

SN - 0034-6527

IS - 3

ER -