The complexity of stochastic games
Information and Computation
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
Languages, automata, and logic
Handbook of formal languages, vol. 3
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The complexity of stochastic rabin and streett games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Games, Time, and Probability: Graph Models for System Design and Analysis
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
25 Years of Model Checking
Games through Nested Fixpoints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
The complexity of stochastic Müller games
Information and Computation
Strategy improvement for stochastic rabin and streett games
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy improvement algorithm for stochastic parity games; this is the first non-brute-force algorithm for solving these games. From the strategy improvement algorithm we obtain a randomized subexponential-time algorithm to solve such games.