Another sub-exponential algorithm for the simple stochastic game
From MaRDI portal
Publication:652540
DOI10.1007/S00453-010-9413-1zbMATH Open1233.91027OpenAlexW2009945194MaRDI QIDQ652540FDOQ652540
Authors: Decheng Dai, Rong Ge 
Publication date: 14 December 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-010-9413-1
Recommendations
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Stochastic games, stochastic differential games (91A15)
Cites Work
Cited In (16)
- An improved heuristic for the ``Ulam-Rényi game
- Comparison of algorithms for simple stochastic games
- Solving simple stochastic games with few coin toss positions
- New algorithms for solving simple stochastic games
- Title not available (Why is that?)
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- New results on simple stochastic games
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- Stochastic limit-average games are in EXPTIME
- Solving Simple Stochastic Games
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
- Title not available (Why is that?)
- On strategy improvement algorithms for simple stochastic games
- On strategy improvement algorithms for simple stochastic games
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- A subexponential randomized algorithm for the simple stochastic game problem
This page was built for publication: Another sub-exponential algorithm for the simple stochastic game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652540)
