Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule

The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm which works in expected $2^{O(\sqrt{n})}$ time. We first give a simpler iterative variant of this algorithm, using Bland's rule from the simplex algorithm, which uses exponentially less random bits than Ludwig's version. Then, we show how to adapt this method to the algorithm of Gimbert and Horn whose worst case complexity is $O(k!)$, where $k$ is the number of random nodes. Our algorithm has an expected running time of $2^{O(k)}$, and works for general random nodes with arbitrary outdegree and probability distribution on outgoing arcs.

[1]  Taolue Chen,et al.  Automatic verification of competitive stochastic systems , 2012, Formal Methods in System Design.

[2]  Oliver Friedmann,et al.  An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[3]  Robert G. Bland,et al.  New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..

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

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

[6]  Peter Bro Miltersen,et al.  Solving simple stochastic games with few coin toss positions , 2012, ESA.

[7]  Uri Zwick,et al.  An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm , 2015, STOC.

[8]  Rong Ge,et al.  New Results on Simple Stochastic Games , 2009, ISAAC.

[9]  R. Karp,et al.  On Nonterminating Stochastic Games , 1966 .

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

[11]  Colin Stirling,et al.  Bisimulation, Modal Logic and Model Checking Games , 1999, Logic Journal of the IGPL.

[12]  Nir Halman,et al.  Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems , 2007, Algorithmica.

[13]  Krishnendu Chatterjee,et al.  A reduction from parity games to simple stochastic games , 2011, GandALF.

[14]  Taolue Chen,et al.  Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving , 2013, QEST.

[15]  V. S. Anil Kumar,et al.  On Strategy Improvement Algorithms for Simple Stochastic Games , 2010, CIAC.

[16]  Kristoffer Arnsfelt Hansen,et al.  Deterministic Graphical Games Revisited , 2008, J. Log. Comput..

[17]  Krishnendu Chatterjee,et al.  Termination criteria for solving concurrent safety and reachability games , 2009, SODA.

[18]  David Auger,et al.  Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games , 2014, TAMC.

[19]  Kousha Etessami,et al.  On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..

[20]  Florian Horn,et al.  Simple Stochastic Games with Few Random Vertices Are Easy to Solve , 2008, FoSSaCS.

[21]  Walter Ludwig,et al.  A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem , 1995, Inf. Comput..

[22]  Cristian S. Calude,et al.  Deciding parity games in quasipolynomial time , 2017, STOC.

[23]  Anne Condon,et al.  On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.