All-pay auctions with ties (Q2677732): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00199-019-01195-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2597308023 / rank | |||
Normal rank |
Revision as of 21:53, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | All-pay auctions with ties |
scientific article |
Statements
All-pay auctions with ties (English)
0 references
6 January 2023
0 references
In this article the authors study the two-player, complete information all-pay auction in which a tie ensues if neither player outbids the other by more than a given amount. More precisely, this paper extends the two-player, complete information all-pay auction by allowing a tie to occur when the difference in expenditures falls below a specified threshold.Under the assumption that winning is preferred to tying and that tying is preferred to losing, this paper completely characterizes the set of equilibrium for the entire parameter space of the margins and tie prizes. About convergence and the equilibrium manifold see Section 5. It is shown that, the discrete strategy space game creates qualitatively different incentives than the continuous strategy space version of the game.
0 references
all-pay auction
0 references
contest
0 references
ties
0 references
draws
0 references
bid differential
0 references