.png){kind=icon}
.png){kind=icon}
Return
Surprise in contests
.png){kind=icon}
OA
AI
DOI：10.1007/s11127-025-01358-2.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a two-player asymmetric dynamic contest with a binary effort choice and a finite number of periods, in which one player wins if and only if he is able to surprise his rival by attacking first. The unique subgame perfect equilibrium in mixed strategies, in which the probability of a surprise increases over time, is examined. It is found that the chance of a surprise is highest at the last minute. Nonetheless, it remains small if the cost of effort is small. With an infinite horizon, the probability remains constant over time; however, it increases as players become more impatient. Applications are discussed.
Keywords:
Dynamic contests
Surprise
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
2.2
Papers:
83
Citations:
5.0K