Solving Simple Stochastic Games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A subexponential randomized algorithm for the simple stochastic game problem
- Exact solution of linear equations using p-adic expansions
- New algorithms for solving simple stochastic games
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Solving Simple Stochastic Games with Few Random Vertices
- Stochastic Games
- The complexity of stochastic games
Cited in
(17)- Solving Games Without Determinization
- Comparison of algorithms for simple stochastic games
- Solving simple stochastic games with few coin toss positions
- Comparison of algorithms for simple stochastic games
- Solvable states in stochastic games
- New algorithms for solving simple stochastic games
- Simple differential search game with mixed strategies
- A generic strategy improvement method for simple stochastic games
- New results on simple stochastic games
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Solving Simple Stochastic Games with Few Random Vertices
- Another sub-exponential algorithm for the simple stochastic game
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- scientific article; zbMATH DE number 3062449 (Why is no real title available?)
- Equilibrium in two-player stochastic games with shift-invariant payoffs
- Simplifying Optimal Strategies in Stochastic Games
- Automatizability and simple stochastic games
This page was built for publication: Solving Simple Stochastic Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507435)