## Frequent Links

# Stochastic game

In game theory, a **stochastic game**, introduced by Lloyd Shapley in the early 1950s, is a dynamic game with **probabilistic transitions** played by one or more players. The game is played in a sequence of stages. At the beginning of each stage the game is in some **state**. The players select actions and each player receives a **payoff** that depends on the current state and the chosen actions. The game then moves to a new random state whose distribution depends on the previous state and the actions chosen by the players. The procedure is repeated at the new state and play continues for a finite or infinite number of stages. The total payoff to a player is often taken to be the discounted sum of the stage payoffs or the limit inferior of the averages of the stage payoffs.

Stochastic games generalize both Markov decision processes and repeated games.

## Contents

## Two-player games

Stochastic two-player games on directed graphs are widely used for modeling and analysis of discrete systems operating in an unknown (adversarial) environment. Possible configurations of a system and its environment are represented as vertices, and the transitions correspond to actions of the system, its environment, or "nature". A run of the system then corresponds to an infinite path in the graph. Thus, a system and its environment can be seen as two players with antagonistic objectives, where one player (the system) aims at maximizing the probability of "good" runs, while the other player (the environment) aims at the opposite.

In many cases, there exists an equilibrium value of this probability, but optimal strategies for both players may not exist.

We introduce basic concepts and algorithmic questions studied in this area, and we mention some long-standing open problems. Then, we mention selected recent results.

## Theory

The ingredients of a stochastic game are: a finite set of players <math>I</math>; a state space <math>M</math> (either a finite set or a measurable space <math>(M,{\mathcal A})</math>); for each player <math>i\in I</math>, an action set <math>S^i</math> (either a finite set or a measurable space <math>(S^i,{\mathcal S}^i)</math>); a transition probability <math>P</math> from <math>M\times S</math>, where <math>S=\times_{i\in I}S^i</math> is the action profiles, to <math>M</math>, where <math>P(A \mid m, s)</math> is the probability that the next state is in <math>A</math> given the current state <math>m</math> and the current action profile <math>s</math>; and a payoff function <math>g</math> from <math>M\times S</math> to <math>R^I</math>, where the <math>i</math>-th coordinate of <math>g</math>, <math>g^i</math>, is the payoff to player <math>i</math> as a function of the state <math>m</math> and the action profile <math>s</math>.

The game starts at some initial state <math>m_1</math>. At stage <math>t</math>, players first observe <math>m_t</math>, then simultaneously choose actions <math>s^i_t\in S^i</math>, then observe the action profile <math>s_t=(s^i_t)_i</math>, and then nature selects <math>m_{t+1}</math> according to the probability <math>P(\cdot\mid m_t,s_t)</math>. A play of the stochastic game, <math>m_1,s_1,\ldots,m_t,s_t,\ldots</math>, defines a stream of payoffs <math>g_1,g_2,\ldots</math>, where <math>g_t=g(m_t,s_t)</math>.

The discounted game <math>\Gamma_\lambda</math> with discount factor <math>\lambda </math> (<math>0<\lambda \leq 1</math>) is the game where the payoff to player <math>i</math> is <math>\lambda \sum_{t=1}^{\infty}(1-\lambda)^{t-1}g^i_t</math>. The <math>n</math>-stage game is the game where the payoff to player <math>i</math> is <math>\bar{g}^i_n:=\frac1n\sum_{t=1}^ng^i_t</math>.

The value <math>v_n(m_1)</math>, respectively <math>v_{\lambda}(m_1)</math>, of a two-person zero-sum stochastic game <math>\Gamma_n</math>, respectively <math>\Gamma_{\lambda}</math>, with finitely many states and actions exists, and Truman Bewley and Elon Kohlberg (1976) proved that <math>v_n(m_1)</math> converges to a limit as <math>n</math> goes to infinity and that <math>v_{\lambda}(m_1)</math> converges to the same limit as <math>\lambda</math> goes to <math>0</math>.

The "undiscounted" game <math>\Gamma_\infty</math> is the game where the payoff to player <math>i</math> is the "limit" of the averages of the stage payoffs. Some precautions are needed in defining the value of a two-person zero-sum <math>\Gamma_{\infty}</math> and in defining equilibrium payoffs of a non-zero-sum <math>\Gamma_{\infty}</math>. The uniform value <math>v_{\infty}</math> of a two-person zero-sum stochastic game <math>\Gamma_\infty</math> exists if for every <math>\varepsilon>0</math> there is a positive integer <math>N</math> and a strategy pair <math>\sigma_{\varepsilon}</math> of player 1 and <math>\tau_{\varepsilon}</math> of player 2 such that for every <math>\sigma</math> and <math>\tau</math> and every <math>n\geq N</math> the expectation of <math>\bar{g}^i_n</math> with respect to the probability on plays defined by <math>\sigma_{\varepsilon} </math> and <math>\tau</math> is at least <math>v_{\infty} -\varepsilon </math>, and the expectation of <math>\bar{g}^i_n</math> with respect to the probability on plays defined by <math>\sigma </math> and <math>\tau_{\varepsilon}</math> is at most <math>v_{\infty} +\varepsilon </math>. Jean-François Mertens and Abraham Neyman (1981) proved that every two-person zero-sum stochastic game with finitely many states and actions has a uniform value.

If there is a finite number of players and the action sets and the set of states are finite, then a stochastic game with a finite number of stages always has a Nash equilibrium. The same is true for a game with infinitely many stages if the total payoff is the discounted sum.

The non-zero-sum stochastic game <math>\Gamma_\infty</math> has a uniform equilibrium payoff <math>v_{\infty}</math> if for every <math>\varepsilon>0</math> there is a positive integer <math>N</math> and a strategy profile <math>\sigma</math> such that for every unilateral deviation by a player <math>i</math>, i.e., a strategy profile <math>\tau</math> with <math>\sigma^j=\tau^j</math> for all <math>j\neq i</math>, and every <math>n\geq N</math> the expectation of <math>\bar{g}^i_n</math> with respect to the probability on plays defined by <math>\sigma</math> is at least <math>v^i_{\infty} -\varepsilon </math>, and the expectation of <math>\bar{g}^i_n</math> with respect to the probability on plays defined by <math>\tau</math> is at most <math>v^i_{\infty} +\varepsilon </math>. Nicolas Vieille has shown that all two-person stochastic games with finite state and action spaces have a uniform equilibrium payoff.

The non-zero-sum stochastic game <math>\Gamma_\infty</math> has a limiting-average equilibrium payoff <math>v_{\infty}</math> if for every <math>\varepsilon>0</math> there is a strategy profile <math>\sigma</math> such that for every unilateral deviation by a player <math>i</math>, the expectation of the limit inferior of the averages of the stage payoffs with respect to the probability on plays defined by <math>\sigma</math> is at least <math>v^i_{\infty} -\varepsilon </math>, and the expectation of the limit superior of the averages of the stage payoffs with respect to the probability on plays defined by <math>\tau</math> is at most <math>v^i_{\infty} +\varepsilon </math>. Jean-François Mertens and Abraham Neyman (1981) proves that every two-person zero-sum stochastic game with finitely many states and actions has a limiting-average value, and Nicolas Vieille has shown that all two-person stochastic games with finite state and action spaces have a limiting-average equilibrium payoff. In particular, these results imply that these games have a value and an approximate equilibrium payoff, called the liminf-average (respectively, the limsup-average) equilibrium payoff, when the total payoff is the limit inferior (or the limit superior) of the averages of the stage payoffs.

Whether every stochastic game with finitely many players, states, and actions, has a uniform equilibrium payoff, or a limiting-average equilibrium payoff, or even a liminf-average equilibrium payoff, is a challenging open question.

A Markov perfect equilibrium is a refinement of the concept of sub-game perfect Nash equilibrium to stochastic games..

## Applications

Stochastic games have applications in economics, evolutionary biology and computer networks.^{[1]} They are generalizations of repeated games which correspond to the special case where there is only one state.

## Referring book

The most complete reference is the book of articles edited by Neyman and Sorin. The more elementary book of Filar and Vrieze provides a unified rigorous treatment of the theories of Markov Decision Processes and two-person stochastic games. They coin the term Competitive MDPs to encompass both one- and two-player stochastic games.

## External links

## Notes

**^**Constrained Stochastic Games in Wireless Networks by E.Altman, K.Avratchenkov, N.Bonneau, M.Debbah, R.El-Azouzi, D.S.Menasche

## Further reading

- Condon, A. (1992). "The complexity of stochastic games".
*Information and Computation***96**: 203–224. doi:10.1016/0890-5401(92)90048-K. - H. Everett (1957). "Recursive games". In Melvin Dresher, Albert William Tucker, Philip Wolfe.
*Contributions to the Theory of Games, Volume 3*. Annals of Mathematics Studies. Princeton University Press. pp. 67–78. ISBN 978-0-691-07936-3. (Reprinted in Harold W. Kuhn, ed.*Classics in Game Theory*, Princeton University Press, 1997. ISBN 978-0-691-01192-9). - Filar, J. & Vrieze, K. (1997).
*Competitive Markov Decision Processes*. Springer-Verlag. ISBN 0-387-94805-8. - Mertens, J. F. & Neyman, A. (1981). "Stochastic Games".
*International Journal of Game Theory***10**(2): 53–66. doi:10.1007/BF01769259. - Neyman, A. & Sorin, S. (2003). "Stochastic Games and Applications". Dordrecht: Kluwer Academic Press. ISBN 1-4020-1492-9.
- Shapley, L. S. (1953). "Stochastic games".
*PNAS***39**(10): 1095–1100. doi:10.1073/pnas.39.10.1095. - Vieille, N. (2002). "Stochastic games: Recent results".
*Handbook of Game Theory*. Amsterdam: Elsevier Science. pp. 1833–1850. ISBN 0-444-88098-4. - Yoav Shoham; Kevin Leyton-Brown (2009).
*Multiagent systems: algorithmic, game-theoretic, and logical foundations*. Cambridge University Press. pp. 153–156. ISBN 978-0-521-89943-7. (suitable for undergraduates; main results, no proofs)