Simple Stochastic Games with Few Random Vertices Are Easy to Solve [chapter]

Hugo Gimbert, Florian Horn
Foundations of Software Science and Computational Structures  
We present a new algorithm for solving Simple Stochastic Games (SSGs). 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|! · (|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 algorithm improves existing algorithms for solving SSGs in three aspects. First, our algorithm
more » ... 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.
doi:10.1007/978-3-540-78499-9_2 dblp:conf/fossacs/GimbertH08 fatcat:of7cmuiilrcmvf4v6lmekcwvai