An orderfield property for stochastic games when one player controls transition probabilities

When the transition probabilities of a two-person stochastic game do not depend on the actions of a fixed player at all states, the value exists in stationary strategies. Further, the data of the stochastic game, the values at each state, and the components of a pair of optimal stationary strategies all lie in the same Archimedean ordered field. This orderfield property holds also for the nonzero sum case in Nash equilibrium stationary strategies. A finite-step algorithm for the discounted case is given via linear programming.

[1]  Harold William Kuhn,et al.  2. ELEMENTARY PROOF OF A MINIMAX THEOREM DUE TO VON NEUMANN , 1951 .

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

[3]  A Charnes,et al.  Constrained Games and Linear Programming. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[4]  P. Wolfe.  9 . Determinateness of Polyhedral Games , 1957 .

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

[6]  H W Kuhn,et al.  AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES. , 1961, Proceedings of the National Academy of Sciences of the United States of America.

[7]  D. Blackwell.  Discrete Dynamic Programming , 1962 .

[8]  L. Shapley.  SOME TOPICS IN TWO-PERSON GAMES , 1963 .

[9]  R. Bellman.  Dynamic programming. , 1957, Science.

[10]  R. Karp,et al.  On Nonterminating Stochastic Games , 1966 .

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

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

[13]  Singiresu S. Rao,et al.  Algorithms for discounted stochastic games , 1973 .

[14]  Elon Kohlberg,et al.  The Asymptotic Theory of Stochastic Games , 1976, Math. Oper. Res..

[15]  The theory of stochastic games by zero stop probabilities , 1977, Advances in Applied Probability.