New algorithms for solving simple stochastic games
From MaRDI portal
Recommendations
Cited in
(20)- Comparison of algorithms for simple stochastic games
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Automatizability and simple stochastic games
- Solving Simple Stochastic Games
- On strategy improvement algorithms for simple stochastic games
- Solving Simple Stochastic Games with Few Random Vertices
- The complexity of solving stochastic games on graphs
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- A reduction from parity games to simple stochastic games
- Comparison of algorithms for simple stochastic games
- Approximating values of generalized-reachability stochastic games
- Computer Science Logic
- Solving simple stochastic tail games
- Exact algorithms for solving stochastic games
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- Fundamentals of Computation Theory
- Deterministic Graphical Games Revisited
- The complexity of mean payoff games
- On strategy improvement algorithms for simple stochastic games
- Another sub-exponential algorithm for the simple stochastic game
This page was built for publication: New algorithms for solving simple stochastic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849562)