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...

We extend a result by Cavazos-Cadena and Lasserre on the existence of strong 1-optimal stationary policies in Markov decision chains with countable state spaces, uniformly ergodic transition probabilities and bounded costs to a larger class of models with unbounded costs and the so-called...

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...

We extend a result by Cavazos-Cadena and Lasserre on the existence of strong 1-optimal stationary policies in Markov decision chains with countable state spaces, uniformly ergodic transition probabilities and bounded costs to a larger class of models with unbounded costs and the so-called...