Unique Bid Auction Games
AbstractTwo auction mechanisms are studied in which players compete with one another for an exogenously determined prize by independently submitting integer bids in some discrete and commonly known strategy space specified by the auctioneer. In the unique lowest (highest) bid auction game, the winner of the prize is the player who submits the lowest (highest) bid provided that this bid is unique, i.e., unmatched by other bids. Assuming a commonly known finite population of players, a non-negative cost of entry, and an option to stay out of the auction if the entry cost is deemed too high, we propose an algorithm for computing symmetric mixed-strategy equilibrium solutions to the two variants of the auction game, illustrate them, and examine their properties.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Friedrich-Schiller-University Jena, Max-Planck-Institute of Economics in its series Jena Economic Research Papers with number 2009-005.
Date of creation: 26 Jan 2009
Date of revision:
Unique bid auction games; Equilibrium analysis;
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Marco Scarsini & Eilon Solan & Nicolas Vieille, 2010. "Lowest Unique Bid Auctions," Papers 1007.4264, arXiv.org.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Markus Pasche).
If references are entirely missing, you can add them using this form.