A reduction from parity games to simple stochastic games

zbMATH Open1460.91027arXiv1106.1232MaRDI QIDQ4964720FDOQ4964720

Authors: Krishnendu Chatterjee, Nathanaël Fijalkow 

Publication date: 3 March 2021

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

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

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)

Cited In (11)

• Model-Free Reinforcement Learning for Stochastic Parity Games
• Title not available (Why is that?)
• Comparison of algorithms for simple stochastic games
• Comparison of algorithms for simple stochastic games
• Optimistic and topological value iteration for simple stochastic games
• Parity game reductions
• Title not available (Why is that?)
• Parity to safety in polynomial time for pushdown and collapsible pushdown systems
• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• Correlated equilibria and fairness in concurrent stochastic games
• Reduction of stochastic parity to stochastic mean-payoff games

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)