Successive Approximation Methods in Undiscounted Stochastic Games

This paper considers undiscounted two-person, zero-sum sequential games with finite state and action spaces. Under conditions that guarantee the existence of stationary optimal strategies, we present two successive approximation methods for finding the optimal gain rate, a solution to the optimality equation, and for any ϵ > 0, ϵ-optimal policies for both players.

[1]  Amedeo R. Odoni,et al.  On Finding the Maximal Gain for Markov Decision Processes , 1969, Oper. Res..

[2]  J. Bather.  Optimal decision procedures for finite markov chains. Part I: Examples , 1973, Advances in Applied Probability.

[3]  Dean Gillette,et al.  9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .

[4]  Awi Federgruen.  On the functional equations in undiscounted and sensitive discounted stochastic games , 1980, Z. Oper. Research.

[5]  P. Schweitzer,et al.  Contraction mappings underlying undiscounted markov decision problems : (preprint) , 1977 .

[6]  P. Schweitzer.  Contraction mappings underlying undiscounted Markov decision problems—II , 1978 .

[7]  J. Bather.  Optimal decision procedures for finite Markov chains. Part III: General convex systems , 1973 .

[8]  W. Barry.  On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov Process , 1965 .

[9]  A. Hordijk,et al.  A MODIFIED FORM OF THE ITERATIVE METHOD OF DYNAMIC PROGRAMMING , 1975 .

[10]  D. White,et al.  Dynamic programming, Markov chains, and the method of successive approximations , 1963 .

[11]  Elon Kohlberg,et al.  On Stochastic Games with Stationary Optimal Strategies , 1978, Math. Oper. Res..

[12]  E. Denardo,et al.  Multichain Markov Renewal Programs , 1968 .

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

[14]  A. Federgruen.  On N-person stochastic games by denumerable state space , 1978, Advances in Applied Probability.

[15]  M. J. Sobel.  Noncooperative Stochastic Games , 1971 .

[16]  W. Jewell.  MARKOV-RENEWAL PROGRAMMING , 1962 .

[17]  M. Pollatschek,et al.  Algorithms for Stochastic Games with Geometrical Interpretation , 1969 .

[18]  Paul J. Schweitzer,et al.  The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems , 1977, Math. Oper. Res..

[19]  P. Schweitzer.  Iterative solution of the functional equations of undiscounted Markov renewal programming , 1971 .