Show simple item record

dc.contributor.authorBoros, Endre
dc.contributor.authorElbassioni, Khaled
dc.contributor.authorFouz, Mahmoud
dc.contributor.authorGurvich, Vladimir
dc.contributor.authorManthey, Bodo
dc.date.accessioned2010-03-20T12:01:00Z
dc.date.accessioned2016-10-05T14:14:17Z
dc.date.available2010-03-20T12:01:00Z
dc.date.available2016-10-05T14:14:17Z
dc.date.issued2010-03-20
dc.identifier.urihttp://publications.mfo.de/handle/mfo/1176
dc.descriptionResearch in Pairs 2010en_US
dc.description.abstractWe consider two-person zero-sum stochastic mean payoff games with perfect information modeled by a digraph with black, white, and random vertices. These BWR-games games are polynomially equivalent with the classical Gillette games, which include many well-known subclasses, such as cyclic games, simple stochastic games, stochastic parity games, and Markov decision processes. They can also be used to model parlor games such as Chess or Backgammon. It is a long-standing open question whether a polynomial algorithm exists that solves BWR-games. In fact, a pseudo-polynomial algorithm for these games with an arbitrary number of random nodes would already imply their polynomial solvability. Currently, only two classes are known to have such a pseudo-polynomial algorithm: BW-games (the case with no random nodes) and ergodic BWR-games (i.e., in which the game's value does not depend on the initial position) with constant number of random nodes. In this paper, we show that the existence of a pseudo-polynomial algorithm for BWR-games with constant number of random vertices implies smoothed polynomial time complexity and the existence of absolute and relative polynomial-time approximation schemes. In particular, we obtain smoothed polynomial time complexity and derive absolute and relative approximation schemes for the above two classes.en_US
dc.language.isoenen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesOberwolfach Preprints;2010,22
dc.titleStochastic mean payoff game: smoothed analysis and approximation schemesen_US
dc.typePreprinten_US
dc.identifier.doi10.14760/OWP-2010-22
local.scientificprogramResearch in Pairs 2010
local.series.idOWP-2010-22


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record