Every n-person stochastic game with a countable state space, finite action sets for the players and bounded, upper semi-continuous payoffs has an -equilibrium for every >0.

This paper discusses the problem regarding the existence of optimal or nearly optimal stationary strategies for a player engaged in a nonleavable stochastic game. It is known that, for these games, player I need not have an -optimal stationary strategy even when the state space of the game is...

There exists a Nash equilibrium (-Nash equilibrium) for every n-person stochastic game with a finite (countable) state space and finite action sets for the players if the payoff to each player i is one when the process of states remains in a given set of states Gi and is zero otherwise.