Abstract
We consider a class of multi-player games with perfect information and deterministic transitions, where each player controls exactly one non-absorbing state, and where rewards are zero for the non-absorbing states. With respect to the average reward, we provide a combinatorial proof that a subgame-perfect ε-equilibrium exists, for every game in our class and for every ε>0. We believe that the proof of this result is an important step towards a proof for the more general hypothesis that all perfect information stochastic games, with finite state space and finite action spaces, have a subgame-perfect ε-equilibrium for every ε>0 with respect to the average reward criterium.
Original language | English |
---|---|
Pages (from-to) | 205-237 |
Number of pages | 33 |
Journal | International Journal of Game Theory |
Volume | 45 |
Issue number | 1-2 |
DOIs | |
Publication status | Published - Mar 2016 |
Keywords
- Perfect information game
- Recursive game
- Subgame-perfect equilibrium
- Average reward
- SEMICONTINUOUS PAYOFFS
- FREE TRANSITION GAMES
- 2-PLAYER STOCHASTIC GAMES