Solving Simple Stochastic Games

  title={Solving Simple Stochastic Games},
  author={Hugo Gimbert and Florian Horn},
We present a new algorithm for solving Simple Stochastic Games (SSGs), which is fixed parameter tractable when parametrized with the number of random vertices. This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is O( |VR|! · (log(|V |)|E| + |p|) ), where |V |, |VR|, |E| and |p| are respectively the number of vertices, random vertices and edges, and the maximum bit-length of a transition probability. Our… CONTINUE READING


Publications citing this paper.
Showing 1-2 of 2 extracted citations

New Results on Simple Stochastic Games

ISAAC • 2009
View 10 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 10 references

New Algorithms for Solving Simple Stochastic Games

Electr. Notes Theor. Comput. Sci. • 2005

On Algorithms for Simple Stochastic Games

Advances In Computational Complexity Theory • 1990

Kachiyan. A polynomial time algorithm for linear programming

L G.
Soviet Math Dokl., • 1979

Stochastic Games.

Proceedings of the National Academy of Sciences of the United States of America • 1953

Similar Papers

Loading similar papers…