论文信息 - Three-Player Absorbing Games

Three-Player Absorbing Games

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.

Eilon Solan

[1] J. M. Coulomb. Repeated games with absorbing states and no signals , 1992 .

[2] C. Hoffmann. Algebraic curves , 1988 .

[3] D. Blackwell,et al. THE BIG MATCH , 1968, Classics in Game Theory.

[4] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[5] A. M. Fink,et al. Equilibrium in a stochastic $n$-person game , 1964 .

[6] O. J. Vrieze,et al. On equilibria in repeated games with absorbing states , 1989 .

[7] E. Kohlberg. Repeated Games with Absorbing States , 1974 .

[8] Otto Forster,et al. Lectures on Riemann Surfaces , 1999 .

[9] Elon Kohlberg,et al. The Asymptotic Theory of Stochastic Games , 1976, Math. Oper. Res..

[10] Sylvain Sorin,et al. Equilibria in repeated games of incomplete information: The general symmetric case , 1998, Int. J. Game Theory.

[11] J. Risler,et al. Real algebraic and semi-algebraic sets , 1990 .

[12] János Flesch,et al. Cyclic Markov equilibria in stochastic games , 1997, Int. J. Game Theory.