Abstract
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.
This research was partially supported by french project ANR ”DOTS”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Condon, A.: The complexity of stochastic games. Information and Computation 96, 203–224 (1992)
Condon, A.: On algorithms for simple stochastic games. In: Advances in computational complexity theory. DIMACS series in discrete mathematics and theoretical computer science, vol. 13, pp. 51–73 (1993)
Derman, C.: Finite State Markov Decision Processes. Academic Press, London (1972)
Dixon, J.D.: Exact solution of linear equations using p-adic expansions. Numerische Mathematik 40, 137–141 (1982)
Gimbert, H., Horn, F.: Solving simple stochastic games with few random vertices (2007), http://hal.archives-ouvertes.fr/hal-00195914/fr/
Halman, N.: Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems. Algorithmica 49, 37–50 (2007)
Kachiyan, L.G.: A polynomial time algorithm for linear programming. Soviet Math. Dokl. 20, 191–194 (1979)
Ludwig, W.: A subexponential randomized algorithm for the simple stochastic game problem. Information and Computation 117, 151–155 (1995)
Renegar, J.: A polynomial-time algorithm, based on newton’s method, for linear programming. Mathematical Programming 40, 59–93 (1988)
Shapley, L.S.: Stochastic games. Proceedings of the National Academy of Science USA 39, 1095–1100 (1953)
Somla, R.: New algorithms for solving simple stochastic games. Electr. Notes Theor. Comput. Sci. 119(1), 51–65 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gimbert, H., Horn, F. (2008). Solving Simple Stochastic Games. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)