Reduction of stochastic parity to stochastic mean-payoff games

Authors:
Krishnendu Chatterjee;Thomas A. Henzinger
Affiliations:
EECS, UC Berkeley, USA;EECS, UC Berkeley, USA and EPFL, Switzerland
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 4

The complexity of stochastic games

Information and Computation
The complexity of mean payoff games on graphs

Theoretical Computer Science
Competitive Markov decision processes

Competitive Markov decision processes
Languages, automata, and logic

Handbook of formal languages, vol. 3
Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters
Quantitative stochastic parity games

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Concurrent games with tail objectives

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

Games through Nested Fixpoints

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
The Complexity of Solving Stochastic Games on Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A pumping algorithm for ergodic stochastic mean payoff games with perfect information

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.90

Visualization

Abstract

A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with @w-regular winning conditions specified as parity objectives, and mean-payoff (or limit-average) objectives. These games lie in NP@?coNP. We present a polynomial-time Turing reduction of stochastic parity games to stochastic mean-payoff games.