Parity Games: Another View on Lehtinen's Algorithm

Recently, five quasi-polynomial-time algorithms solving parity games were proposed. We elaborate on one of the algorithms, by Lehtinen (2018). Czerwinski et al. (2019) observe that four of the algorithms can be expressed as constructions of separating automata (of quasi-polynomial size), that is, automata that accept all plays decisively won by one of the players, and rejecting all plays decisively won by the other player. The separating automata corresponding to three of the algorithms are deterministic, and it is clear that deterministic separating automata can be used to solve parity games. The separating automaton corresponding to the algorithm of Lehtinen is nondeterministic, though. While this particular automaton can be used to solve parity games, this is not true for every nondeterministic separating automaton. As a first (more conceptual) contribution, we specify when a nondeterministic separating automaton can be used to solve parity games. We also repeat the correctness proof of the Lehtinen's algorithm, using separating automata. In this part, we prove that her construction actually leads to a faster algorithm than originally claimed in her paper: its complexity is $n^{O(\log n)}$ rather than $n^{O(\log d \cdot \log n)}$ (where $n$ is the number of nodes, and $d$ the number of priorities of a considered parity game), which is similar to complexities of the other quasi-polynomial-time algorithms.

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

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

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

[4]  Thomas A. Henzinger,et al.  Solving Games Without Determinization , 2006, CSL.

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

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

[7]  Bakhadyr Khoussainov A Brief Excursion to Parity Games , 2018, DLT.

[8]  Thomas Colcombet,et al.  Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games , 2019, FoSSaCS.

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

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

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

[12]  E. Emerson,et al.  Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.

[13]  Hugo Gimbert,et al.  A short proof of correctness of the quasi-polynomial time algorithm for parity games , 2017, ArXiv.

[14]  Christos H. Papadimitriou,et al.  Continuous local search , 2011, SODA '11.

[15]  Helmut Seidl Fast and Simple Nested Fixpoints , 1996, Inf. Process. Lett..

[16]  M. Rabin Automata on Infinite Objects and Church's Problem , 1972 .

[17]  Roland Meyer,et al.  Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems , 2018, MFCS.

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

[19]  Massimo Benerecetti,et al.  Solving parity games via priority promotion , 2016, CAV.

[20]  Sanjay Jain,et al.  An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space , 2017, International Journal on Software Tools for Technology Transfer.

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

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

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

[24]  Igor Walukiewicz,et al.  Permissive strategies: from parity games to safety games , 2002, RAIRO Theor. Informatics Appl..

[25]  Wladimir Fridman,et al.  Playing Pushdown Parity Games in a Hurry , 2012, GandALF.

[26]  Sven Schewe,et al.  Solving parity games in big steps , 2007, J. Comput. Syst. Sci..

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

[28]  Henrik Björklund,et al.  A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discret. Appl. Math..

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

[30]  Somesh Jha,et al.  An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1997, Theor. Comput. Sci..

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

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