Solving Simple Stochastic Games

Hugo Gimbert (1) , Florian Horn (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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 , where and are respectively the number of vertices, random vertices and edges, and the maximum bit-length of a transition probability. Our algorithm improves existing algorithms for solving SSGs in three aspects. First, our algorithm performs well on SSGs with few random vertices, second it does not rely on linear or quadratic programming, third it applies to all SSGs, not only stopping SSGs.

Domaines: Informatique et théorie des jeux [cs.GT]

Hugo Gimbert, Florian Horn. Solving Simple Stochastic Games. CIE 2008, Jun 2008, France. pp.206/209, ⟨10.1007/978-3-540-69407-6_24⟩. ⟨hal-00344228⟩