The complexity of solving stochastic games on graphs
From MaRDI portal
Recommendations
Cited in
(53)- Games, complexity classes, and approximation algorithms.
- The complexity of stochastic games
- The complexity of mean payoff games on graphs
- Complexity of path discovery game problems
- Stochastic games on a graph
- Tropically convex constraint satisfaction
- A convex programming-based algorithm for mean payoff stochastic games with perfect information
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- Tropical spectrahedra
- Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs
- The operator approach to entropy games
- Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- A potential reduction algorithm for two-person zero-sum mean payoff stochastic games
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Solvency Markov decision processes with interest
- Stochastic mean payoff games: smoothed analysis and approximation schemes
- Automatizability and simple stochastic games
- On the Complexity of Non-reversible Betting Games on Many-Valued Events
- Quantitative verification and strategy synthesis for stochastic games
- The Complexity of Synthesis from Probabilistic Components
- Games through Nested Fixpoints
- A Survey of Stochastic Games with Limsup and Liminf Objectives
- On canonical forms for zero-sum stochastic mean payoff games
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- The complexity of stochastic Müller games
- scientific article; zbMATH DE number 1017515 (Why is no real title available?)
- scientific article; zbMATH DE number 1047712 (Why is no real title available?)
- Constant rank two-player games are PPAD-hard
- Stability in graphs and games
- A reduction from parity games to simple stochastic games
- Constraint satisfaction problems over numeric domains
- A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
- Model-Free Reinforcement Learning for Stochastic Parity Games
- Solving simple stochastic games with few random nodes faster using Bland's rule
- Towards solving 2-TBSG efficiently
- Stochastic games
- Strategy recovery for stochastic mean payoff games
- The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games
- Exact algorithms for solving stochastic games
- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
- Strategy Improvement for Stochastic Rabin and Streett Games
- The complexity of mean payoff games
- Optimistic and topological value iteration for simple stochastic games
- On the complexity of computational problems associated with simple stochastic games
- Deterministic sub-exponential algorithm for discounted-sum games with unary weights
- Multi-objective -regular reinforcement learning
- Stochastic games for distributed players on graphs.
- Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games
- Stochastic limit-average games are in EXPTIME
This page was built for publication: The complexity of solving stochastic games on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652196)
