Three-Player Absorbing Games
Author:
- 1 August 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 24 (3) , 669-698
Abstract
An n-player absorbing game is an n-player stochastic game where all the states but one are absorbing (a state is absorbing if once it is reached, the probability to leave it is zero, whatever the players play). We prove that every three-player absorbing game has an undiscounted equilibrium payoff.Keywords
This publication has 8 references indexed in Scilit:
- Equilibria in repeated games of incomplete information: The general symmetric caseInternational Journal of Game Theory, 1998
- Cyclic Markov equilibria in stochastic gamesInternational Journal of Game Theory, 1997
- On equilibria in repeated games with absorbing statesInternational Journal of Game Theory, 1989
- Stochastic gamesInternational Journal of Game Theory, 1981
- The Asymptotic Theory of Stochastic GamesMathematics of Operations Research, 1976
- Repeated Games with Absorbing StatesThe Annals of Statistics, 1974
- The Big MatchThe Annals of Mathematical Statistics, 1968
- Equilibrium in a stochastic $n$-person gameHiroshima Mathematical Journal, 1964