TY - JOUR
T1 - Absorption paths and equilibria in quitting games
AU - Ashkenazi-Golan, Galit
AU - Krasikov, Ilia
AU - Rainer, Catherine
AU - Solan, Eilon
N1 - Publisher Copyright:
© 2022, The Author(s).
PY - 2022
Y1 - 2022
N2 - We study quitting games and introduce an alternative notion of strategy profiles—absorption paths. An absorption path is parametrized by the total probability of absorption in past play rather than by time, and it accommodates both discrete-time aspects and continuous-time aspects. We then define the concept of sequentially 0-perfect absorption paths, which are shown to be limits of ε-equilibrium strategy profiles as ε goes to 0. We establish that all quitting games that do not have simple equilibria (that is, an equilibrium where the game terminates in the first period or one where the game never terminates) have a sequentially 0-perfect absorption path. Finally, we prove the existence of sequentially 0-perfect absorption paths in a new class of quitting games.
AB - We study quitting games and introduce an alternative notion of strategy profiles—absorption paths. An absorption path is parametrized by the total probability of absorption in past play rather than by time, and it accommodates both discrete-time aspects and continuous-time aspects. We then define the concept of sequentially 0-perfect absorption paths, which are shown to be limits of ε-equilibrium strategy profiles as ε goes to 0. We establish that all quitting games that do not have simple equilibria (that is, an equilibrium where the game terminates in the first period or one where the game never terminates) have a sequentially 0-perfect absorption path. Finally, we prove the existence of sequentially 0-perfect absorption paths in a new class of quitting games.
KW - Continuous equilibria
KW - Linear complementarity problems
KW - Q-matrices
KW - Quitting games
KW - Stochastic games
UR - http://www.scopus.com/inward/record.url?scp=85128753690&partnerID=8YFLogxK
U2 - 10.1007/s10107-022-01807-6
DO - 10.1007/s10107-022-01807-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85128753690
SN - 0025-5610
JO - Mathematical Programming
JF - Mathematical Programming
ER -