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
POST COMMENT

Comments

There are no comments yet.

Authors

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...
∙ 04/16/2021

Priority Promotion with Parysian Flair

We develop an algorithm that combines the advantages of priority promoti...
∙ 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...
∙ 04/17/2018

Parity Games with Weights

Quantitative extensions of parity games have recently attracted signific...
∙ 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...
∙ 07/17/2020

On Algorithms for Solving the Rubik's Cube

In this paper, we present a novel algorithm and its three variations for...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.