On the computational complexity of solving stochastic mean-payoff games
Computer Science and Game Theory
2008-12-03 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0812.0486,
title = {On the computational complexity of solving stochastic mean-payoff games},
author = {Vladimir Gurvich and Peter Bro Miltersen},
journal= {arXiv preprint arXiv:0812.0486},
year = {2008}
}
Comments
s