论文信息 - On the computational complexity of solving stochastic mean-payoff games

On the computational complexity of solving stochastic mean-payoff games

We consider some well-known families of two-player, zero-sum, perfect information games that can be viewed as special cases of Shapley's stochastic games. We show that the following tasks are polynomial time equivalent: - Solving simple stochastic games. - Solving stochastic mean-payoff games with rewards and probabilities given in unary. - Solving stochastic mean-payoff games with rewards and probabilities given in binary.

Peter Bro Miltersen | Vladimir Gurvich

[1] Krishnendu Chatterjee,et al. Reduction of stochastic parity to stochastic mean-payoff games , 2008, Inf. Process. Lett..

[2] Uri Zwick,et al. The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[3] S. Lippman,et al. Stochastic Games with Perfect Information and Time Average Payoff , 1969 .

[4] Anne Condon,et al. The Complexity of Stochastic Games , 1992, Inf. Comput..

[5] Krishnendu Chatterjee,et al. Quantitative stochastic parity games , 2004, SODA '04.

[6] A. Karzanov,et al. Cyclic games and an algorithm to find minimax cycle means in directed graphs , 1990 .

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

[8] Krishnendu Chatterjee,et al. Simple Stochastic Parity Games , 2003, CSL.

[9] Michael L. Littman,et al. Algorithms for Sequential Decision Making , 1996 .

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

[11] Krishnendu Chatterjee,et al. Stochastic limit-average games are in EXPTIME , 2008, Int. J. Game Theory.

[12] J. Filar. Ordered field property for stochastic games when the player who controls transitions changes from state to state , 1981 .

[13] R. Bellman,et al. Dynamic Programming and Markov Processes , 1960 .