The present note analyzes the Simultaneous Ascending Bid Auction with arbitrarily many bidders with decreasing marginal valuations under complete information. We show that the game is solvable by iterated elimination of weakly dominated strategies if the efficient allocation assigns at least one unit to every player and if bid increments are sufficiently small. In that unique equilibrium, bidders immediately reduce their demand to the efficient allocation, and the auction ends in the first round of bidding.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by CESifo Group Munich in its series CESifo Working Paper Series with number
CESifo Working Paper No. 1315.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Peter Cramton, 1998.
"Ascending Auctions,"
Papers of Peter Cramton
98eer, University of Maryland, Department of Economics - Peter Cramton, revised 28 Jul 1998.
[Downloadable!]
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Elmar Wolfstetter, 2005.
"Procurement of Goods and Services – Scope and Government,"
Discussion Papers
93, SFB/TR 15 Governance and the Efficiency of Economic Systems, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
[Downloadable!]