Nowak, Andrzej S. - In: Mathematical Methods of Operations Research 50 (1999) 1, pp. 65-76
We consider stochastic games with countable state spaces and unbounded immediate payoff functions. Our assumptions on the transition structure of the game are based on a recent work by Meyn and Tweedie [19] on computable bounds for geometric convergence rates of Markov chains. The main results...
