A deterministic subexponential algorithm for solving parity games

The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms of Kalai and of Matousek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. Our deterministic algorithm is almost as fast as the randomized algorithms mentioned above.

[1]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[3]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[5]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[6]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[7]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[8]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[9]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[10]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

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

[12]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[13]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[14]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[15]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[16]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[17]  Orna Kupferman,et al.  On the Complexity of Parity Word Automata , 2001, FoSSaCS.

[18]  Bernd Gärtner.  The Random-Facet simplex algorithm on combinatorial cubes , 2002, Random Struct. Algorithms.

[19]  Jan Obdrzálek,et al.  Fast Mu-Calculus Model Checking when Tree-Width Is Bounded , 2003, CAV.

[20]  Henrik Björklund,et al.  A Discrete Subexponential Algorithm for Parity Games , 2003, STACS.

[21]  Rupak Majumdar,et al.  Quantitative solution of omega-regular games , 2004, J. Comput. Syst. Sci..

[22]  Krishnendu Chatterjee,et al.  Quantitative stochastic parity games , 2004, SODA '04.

[23]  Henrik Björklund,et al.  Randomized Subexponential Algorithms for Infinite Games , 2004 .

[24]  Bernd Gärtner,et al.  Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems , 2005, FCT.

[25]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[26]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[27]  Ola Svensson,et al.  Linear Complementarity and P-Matrices for Stochastic Games , 2006, Ershov Memorial Conference.

[28]  Henrik Björklund,et al.  A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discrete Applied Mathematics.

[29]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.