Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/127294 
Year of Publication: 
2008
Series/Report no.: 
Discussion Paper Series No. 471
Publisher: 
University of Heidelberg, Department of Economics, Heidelberg
Abstract: 
Least-Unmatched Price Auctions have become a popular format of TV and radio shows. Increasingly, they are also applied in internet trading. In these auctions the lowest single (unique) bid wins. We analyze the game-theoretic solution of least unmatched price auctions when prize, bidding cost and the number of participants are known. We use a large data-set of such auctions in order to contrast actual behavior of players with game-theoretic predictions. In the aggregate, bidding behaviour seems to conform with a Nash equilibrium in mixed strategies.
Subjects: 
games
experiments
JEL: 
C71
C93
D01
D81
Document Type: 
Working Paper

Files in This Item:
File
Size
1.61 MB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.