Recursive Stochastic Games with Positive Rewards

DOI10.1007/978-3-540-70575-8_58zbMath1153.91328OpenAlexW1544822727MaRDI 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

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)

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations ⋮ Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes ⋮ Recursive stochastic games with positive rewards ⋮ Qualitative reachability in stochastic BPA games ⋮ Unnamed Item ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games

This page was built for publication: Recursive Stochastic Games with Positive Rewards