A reduction from parity games to simple stochastic games

zbMATHMaRDI QIDQ4964720FDO

Authors Krishnendu Chatterjee, Nathanaël Fijalkow

Publication date 3 March 2021

Full work available at URL https://arxiv.org/abs/1106.1232

zbMATH Keywords

reachability objectivesstochastic gamesparity objectives

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43)

Recommendations

• Reduction of stochastic parity to stochastic mean-payoff games
• Computer Science Logic
• New algorithms for solving simple stochastic games
• The complexity of solving stochastic games on graphs
• Parity game reductions

Cited in

(11)

• Parity to safety in polynomial time for pushdown and collapsible pushdown systems
• Parity game reductions
• Model-Free Reinforcement Learning for Stochastic Parity Games
• Optimistic and topological value iteration for simple stochastic games
• Correlated equilibria and fairness in concurrent stochastic games
• Reduction of stochastic parity to stochastic mean-payoff games
• scientific article; zbMATH DE number 7559118 (Why is no real title available?)
• Comparison of algorithms for simple stochastic games
• Comparison of algorithms for simple stochastic games
• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• scientific article; zbMATH DE number 5171562 (Why is no real title available?)

This page was built for publication: A reduction from parity games to simple stochastic games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964720)