TY - JOUR
T1 - Absorbing games with a clock and two bits of memory
AU - Hansen, Kristoffer Arnsfelt
AU - Ibsen-Jensen, Rasmus
AU - Neyman, Abraham
N1 - Publisher Copyright:
© 2021
PY - 2021/7
Y1 - 2021/7
N2 - An absorbing game is a two-person zero-sum repeated game. Some of the entries are “absorbing” in the sense that, following the play of an absorbing entry, with positive probability all future payoffs are equal to that entry's payoff. The outcome of the game is the long-run average payoff. We prove that a two-person zero-sum absorbing game, with either finite or compact action sets, has, for each ε>0, ε-optimal strategies with finite memory. In fact, we show that there is an ε-optimal strategy that depends on the clock and three states of memory.
AB - An absorbing game is a two-person zero-sum repeated game. Some of the entries are “absorbing” in the sense that, following the play of an absorbing entry, with positive probability all future payoffs are equal to that entry's payoff. The outcome of the game is the long-run average payoff. We prove that a two-person zero-sum absorbing game, with either finite or compact action sets, has, for each ε>0, ε-optimal strategies with finite memory. In fact, we show that there is an ε-optimal strategy that depends on the clock and three states of memory.
KW - Absorbing games
KW - Compact action sets
KW - Finite memory
KW - Markov strategies
KW - Stochastic games
UR - http://www.scopus.com/inward/record.url?scp=85106231920&partnerID=8YFLogxK
U2 - 10.1016/j.geb.2021.04.008
DO - 10.1016/j.geb.2021.04.008
M3 - Journal article
AN - SCOPUS:85106231920
SN - 0899-8256
VL - 128
SP - 213
EP - 230
JO - Games and Economic Behavior
JF - Games and Economic Behavior
ER -