Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
From MaRDI portal
Publication:5449826
DOI10.1007/11672142_42zbMath1136.91322MaRDI QIDQ5449826
Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11672142_42
68Q25: Analysis of algorithms and problem complexity
91A43: Games involving graphs
91A15: Stochastic games, stochastic differential games
68W20: Randomized algorithms
Related Items
Deciding Parity Games in Quasi-polynomial Time, Stochastic Müller Games are PSPACE-Complete, Quantitative verification and strategy synthesis for stochastic games, A survey of stochastic \(\omega \)-regular games, The complexity of stochastic Müller games, Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games, Value Iteration