On the computational complexity of solving stochastic mean-payoff games [article]

Vladimir Gurvich, Peter Bro Miltersen
2008 arXiv   pre-print
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.
arXiv:0812.0486v1 fatcat:f7h44jvya5ae3lzuxfsdniqqmi