A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it

This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdziski. First, we informally show which structures are difficult to solve for the algorithm. Second, we outline a family of games of quadratic size on which the algorithm requires exponentially many strategy iterations, answering in the negative the long-standing question whether this algorithm runs in polynomial time. Additionally we note that the same family of games can be used to prove a similar result w.r.t. the strategy improvement variant by Schewe.

[1]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[2]  M. Paterson,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.

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

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

[5]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[6]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

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

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

[9]  M. Lange,et al.  The PGSolver Collection of Parity Game Solvers Version 3 , 2010 .

[10]  Nellie Clarke Brown.  Trees , 1896, Savage Dreams.

[11]  Colin Stirling,et al.  Local model checking games (extended abstract) , 1995 .

[12]  Sven Schewe,et al.  An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games , 2008, CSL.

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

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

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

[16]  Perdita Stevens,et al.  Practical Model-Checking Using Games , 1998, TACAS.