The complexity of stochastic games
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Competitive Markov decision processes
Competitive Markov decision processes
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dynamic Programming and Optimal Control, Two Volume Set
Dynamic Programming and Optimal Control, Two Volume Set
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Solving Simple Stochastic Games
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
New Results on Simple Stochastic Games
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Simple stochastic games with few random vertices are easy to solve
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Solving simple stochastic tail games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On strategy improvement algorithms for simple stochastic games
Journal of Discrete Algorithms
Automatizability and simple stochastic games
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On strategy improvement algorithms for simple stochastic games
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
| Hi-index | 0.00 |
We present new algorithms for determining optimal strategies for two-player games with proba- bilistic moves and reachability winning conditions. Such games, known as simple stochastic games, were extensively studied by A.Condon [Anne Condon. The complexity of stochastic games. Information and Computation, 96(2):203-224, 1992, Anne Condon. On algorithms for simple stochastic games. In Jin-Yi Cai, editor, Advances in Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 51-73. AMS, 1993]. Many interesting problems, including parity games and hence also mu-calculus model checking, can be reduced to simple stochastic games. It is an open problem, whether simple stochastic games can be solved in polynomial time. Our algorithms determine the optimal expected payoffs in the game. We use geometric interpre- tation of the search space as a subset of the hyper-cube [0,1]^N. The main idea is to divide this set into convex subregions in which linear optimization methods can be used. We show how one can proceed from one subregion to the other so that, eventually, a region containing the optinal payoffs will be found. The total number of subregions is exponential in the size of the game but, in practice, the algorithms need to visit only few of them to find a solution. We believe that our new algorithms could provide new insights into the difficult problem of deter- mining algorithmic complexity of simple stochastic games and other, equivallent problems.