Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
From MaRDI portal
Publication:5449826
DOI10.1007/11672142_42zbMath1136.91322OpenAlexW1492878012MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Randomized algorithms (68W20)
Related Items (7)
Quantitative verification and strategy synthesis for stochastic games ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ 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 ⋮ Stochastic Müller Games are PSPACE-Complete
This page was built for publication: Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games