A Recursive Approach to Solving Parity Games in Quasipolynomial Time

04/20/2021
∙
by   Karoliina Lehtinen, et al.
∙
0
∙

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^𝒪(log(1+d/log n)), for parity games of size n with d priorities, in line with previous quasipolynomial-time solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

∙ 09/10/2018

A Comparison of BDD-Based Parity Game Solvers

Parity games are two player games with omega-winning conditions, played ...
∙ 04/26/2019

Improving the complexity of Parys' recursive algorithm

Parys has recently proposed a quasi-polynomial version of Zielonka's rec...
∙ 07/25/2023

Solving Odd-Fair Parity Games

This paper discusses the problem of efficiently solving parity games whe...
∙ 04/16/2021

Priority Promotion with Parysian Flair

We develop an algorithm that combines the advantages of priority promoti...
∙ 10/03/2021

A Recursive Algorithm for Solving Simple Stochastic Games

We present two recursive strategy improvement algorithms for solving sim...
∙ 05/08/2018

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems

We give a direct polynomial-time reduction from parity games played over...
∙ 02/12/2016

Bouncing Towers move faster than Hanoi Towers, but still require exponential time

The problem of the Hanoi Tower is a classic exercise in recursive progra...

Please sign up or login with your details

Forgot password? Click here to reset