A Recursive Approach to Solving Parity Games in Quasipolynomial Time

Zielonka’s classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have quasipolynomial complexity. Here, we present a modification of Zielonka’s classic algorithm that brings its complexity down to n O ( log ( 1+ d log n )) , for parity games of size n with d priorities, in line with previous quasipolynomial-time solutions.

[1]  Marcin Jurdzinski,et al.  Alternating Weak Automata from Universal Trees , 2019, CONCUR.

[2]  Oliver Friedmann,et al.  Recursive algorithm for parity games requires exponential time , 2011, RAIRO Theor. Informatics Appl..

[3]  Pawel Parys,et al.  Parity Games: Another View on Lehtinen's Algorithm , 2019, CSL.

[4]  Udi Boker,et al.  On the Way to Alternating Weak Automata , 2018, FSTTCS.

[5]  The Strahler number of a parity game , 2020, ICALP.

[6]  Sanjay Jain,et al.  An ordered approach to solving parity games in quasi polynomial time and quasi linear space , 2017, SPIN.

[7]  Karoliina Lehtinen,et al.  A modal μ perspective on solving parity games in quasi-polynomial time , 2018, LICS.

[8]  Sven Schewe,et al.  Improving the complexity of Parys' recursive algorithm , 2019, ArXiv.

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

[10]  Marcin Jurdzinski,et al.  Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games , 2018, SODA.

[11]  John Fearnley,et al.  Exponential Lower Bounds for Policy Iteration , 2010, ICALP.

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

[13]  Tom van Dijk,et al.  Oink: an Implementation and Evaluation of Modern Parity Game Solvers , 2018, TACAS.

[14]  Oliver Friedmann,et al.  A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games , 2011, IPCO.

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

[16]  Pierre Ohlmann,et al.  A symmetric attractor-decomposition lifting algorithm for parity games , 2020, ArXiv.

[17]  Constance de Koning,et al.  Editors , 2003, Annals of Emergency Medicine.

[18]  U. Dulleck,et al.  μ-σ Games , 2012, Games.

[19]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[20]  Marcin Jurdzinski,et al.  Succinct progress measures for solving parity games , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

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

[22]  Pawel Parys,et al.  Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time , 2019, MFCS.

[23]  Marcin Jurdzi'nski,et al.  A Universal Attractor Decomposition Algorithm for Parity Games , 2020, ArXiv.

[24]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

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

[26]  W. Browder,et al.  Annals of Mathematics , 1889 .

[27]  P. Dangerfield.  Logic , 1996, Aristotle and the Stoics.

[28]  Massimo Benerecetti,et al.  Robust worst cases for parity games algorithms , 2020, Inf. Comput..

[29]  M. Gazda,et al.  Fixpoint logic, games, and relations of consequence , 2016 .

[30]  Pawel Parys,et al.  A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation , 2021, CSL.

[31]  Uri Zwick,et al.  Subexponential lower bounds for randomized pivoting rules for the simplex algorithm , 2011, STOC '11.