Solving simple stochastic games with few random nodes faster using Bland's rule
From MaRDI portal
Publication:5090455
Recommendations
Cites work
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- A reduction from parity games to simple stochastic games
- A subexponential randomized algorithm for the simple stochastic game problem
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- Automatic verification of competitive stochastic systems
- Bisimulation, modal logic and model checking games
- Deciding parity games in quasipolynomial time
- Deterministic Graphical Games Revisited
- Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
- New Finite Pivoting Rules for the Simplex Method
- New results on simple stochastic games
- On Nonterminating Stochastic Games
- On stochastic games with multiple objectives
- On strategy improvement algorithms for simple stochastic games
- On the Complexity of Nash Equilibria and Other Fixed Points
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Solving simple stochastic games with few coin toss positions
- Stochastic Games
- Termination criteria for solving concurrent safety and reachability games
- The complexity of solving stochastic games on graphs
- The complexity of stochastic games
This page was built for publication: Solving simple stochastic games with few random nodes faster using Bland's rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090455)
