Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games

DOI10.1007/11672142_52zbMath1136.90499OpenAlexW1498910922MaRDI QIDQ5449837

Kousha Etessami, Mihalis Yannakakis

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_52

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40)

Related Items (6)

Equilibria, fixed points, and complexity classes ⋮ Reachability in recursive Markov decision processes ⋮ Approximating the Termination Value of One-Counter MDPs and Stochastic Games ⋮ Regularity in PDA Games Revisited ⋮ Qualitative reachability in stochastic BPA games ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games

This page was built for publication: Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games