Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
From MaRDI portal
Publication:5449837
DOI10.1007/11672142_52zbMath1136.90499MaRDI 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
68Q25: Analysis of algorithms and problem complexity
91A15: Stochastic games, stochastic differential games
90C40: Markov and semi-Markov decision processes
Related Items
Regularity in PDA Games Revisited, Equilibria, fixed points, and complexity classes, Qualitative reachability in stochastic BPA games, Reachability in recursive Markov decision processes, Recursive Markov Decision Processes and Recursive Stochastic Games, Approximating the Termination Value of One-Counter MDPs and Stochastic Games