Recursive Stochastic Games with Positive Rewards
From MaRDI portal
Publication:3521960
DOI10.1007/978-3-540-70575-8_58zbMath1153.91328MaRDI QIDQ3521960
Kousha Etessami, Mihalis Yannakakis, Dominik Wojtczak
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_58
68Q25: Analysis of algorithms and problem complexity
91A15: Stochastic games, stochastic differential games
90C40: Markov and semi-Markov decision processes
Related Items
Unnamed Item, Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations, Qualitative reachability in stochastic BPA games, Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes, Recursive stochastic games with positive rewards, Recursive Markov Decision Processes and Recursive Stochastic Games