On the computational complexity of solving stochastic mean-payoff games

Simple item page
dc.creatorGurvich, Vladimir
dc.creatorMiltersen, Peter Bro
dc.date2008-12-02
dc.date.accessioned2026-07-07T12:08:37Z
dc.date.available2026-07-07T12:08:37Z
dc.descriptionWe 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.
dc.descriptions
dc.identifierhttps://arxiv.org/abs/0812.0486
dc.identifierhttp://arxiv.org/abs/0812.0486
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209382
dc.subjectComputer Science and Game Theory
dc.titleOn the computational complexity of solving stochastic mean-payoff games
dc.typetext

Files

Collections

arXiv