Determinacy and optimal strategies in infinite-state stochastic reachability games

DOI10.1016/j.tcs.2012.10.038zbMath1294.91021OpenAlexW2025329997MaRDI QIDQ391114

Václav Brožek

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.038

zbMATH Keywords

reachabilitystochastic gamesoptimal strategiesdeterminacy

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Cites Work

• Qualitative reachability in stochastic BPA games
• Reachability in recursive Markov decision processes
• The complexity of stochastic games
• Approximating the Termination Value of One-Counter MDPs and Stochastic Games
• The determinacy of Blackwell games
• Qualitative Reachability in Stochastic BPA Games
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Determinacy and optimal strategies in infinite-state stochastic reachability games