Comparison of algorithms for simple stochastic games
From MaRDI portal
Recommendations
Cites work
- A game-based abstraction-refinement framework for Markov decision processes
- A reduction from parity games to simple stochastic games
- A subexponential randomized algorithm for the simple stochastic game problem
- A survey of stochastic -regular games
- Another sub-exponential algorithm for the simple stochastic game
- Approximating values of generalized-reachability stochastic games
- Efficient strategy iteration for mean payoff in Markov decision processes
- Ensuring the reliability of your model checker: interval iteration for Markov decision processes
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 7204389 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Interval iteration algorithm for MDPs and IMDPs
- Model-Checking ω-Regular Properties of Interval Markov Chains
- New algorithms for solving simple stochastic games
- Of cores: a partial-exploration framework for Markov decision processes
- On Nonterminating Stochastic Games
- On stochastic games with multiple objectives
- Optimistic value iteration
- PAC statistical model checking for Markov decision processes and stochastic games
- Quantitative verification and strategy synthesis for stochastic games
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- Solving simple stochastic games with few coin toss positions
- Sound value iteration
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- The complexity of mean payoff games on graphs
- The complexity of probabilistic verification
- The complexity of stochastic games
- The polynomial solvability of convex quadratic programming
- Topological value iteration algorithms
- Value Iteration
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Verification of Markov decision processes using learning algorithms
Cited in
(5)- Comparison of algorithms for simple stochastic games
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Symbolic verification and strategy synthesis for turn-based stochastic games
- Optimistic and topological value iteration for simple stochastic games
- Stochastic games with disjunctions of multiple objectives
This page was built for publication: Comparison of algorithms for simple stochastic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021007)