Exact Algorithms for Solving Stochastic Games

Shapley’s discounted stochastic games, Everett’s recursive games and Gillette’s undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games. When the number of positions of the game is constant, our algorithms run in polynomial time.

[1]  Kristoffer Arnsfelt Hansen,et al.  Winning Concurrent Reachability Games Requires Doubly-Exponential Patience , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[2]  Daniel Perrucci,et al.  On the minimum of a positive polynomial over the standard simplex , 2009, J. Symb. Comput..

[3]  Kristoffer Arnsfelt Hansen,et al.  The Complexity of Solving Reachability Games Using Value and Strategy Iteration , 2011, CSR.

[4]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[5]  Marie-Françoise Roy,et al.  Bounding the radii of balls meeting every connected component of semi-algebraic sets , 2009, J. Symb. Comput..

[6]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[7]  Michael Orkin.  Recursive matrix games , 1972 .

[8]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[9]  R. Thom.  Sur L'Homologie des Varietes Algebriques Réelles , 1965 .

[10]  D. Blackwell,et al.  THE BIG MATCH , 1968, Classics in Game Theory.

[11]  Kousha Etessami,et al.  Recursive Concurrent Stochastic Games , 2008, Log. Methods Comput. Sci..

[12]  Peter Bro Miltersen,et al.  The Complexity of Solving Stochastic Games on Graphs , 2009, ISAAC.

[13]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[14]  Bernard Mourrain,et al.  The DMM bound: multivariate (aggregate) separation bounds , 2010, ISSAC.

[15]  John F. Canny,et al.  Generalised Characteristic Polynomials , 1990, J. Symb. Comput..

[16]  Chee-Keng Yap,et al.  Fundamental problems of algorithmic algebra , 1999 .

[17]  Krishnendu Chatterjee,et al.  Stochastic limit-average games are in EXPTIME , 2008, Int. J. Game Theory.

[18]  Martin Sombra.  The height of the mixed sparse resultant , 2002 .

[19]  R. Stanley.  Enumerative Combinatorics: Volume 1 , 2011 .

[20]  Zhou Jian-Ping.  On the degree of extensions generated by finitely many algebraic numbers , 1990 .

[21]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[22]  Singiresu S. Rao,et al.  Algorithms for discounted stochastic games , 1973 .

[23]  Saugata Basu.  Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets , 2003, Discret. Comput. Geom..

[24]  Krishnendu Chatterjee,et al.  Strategy Improvement for Concurrent Reachability Games , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[25]  Bernard Hanzon,et al.  REPORT RAPPORT , 2001 .

[26]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[27]  Maurice Mignotte,et al.  Mathematics for computer algebra , 1991 .

[28]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[29]  J. Milnor.  On the Betti numbers of real varieties , 1964 .

[30]  Dean Gillette,et al.  9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .

[31]  Elon Kohlberg,et al.  The Asymptotic Theory of Stochastic Games , 1976, Math. Oper. Res..