A Recursive Approach to Solving Parity Games in Quasipolynomial Time

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