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 …

Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time
algorithm solving parity games. After this breakthrough result, a few other quasi-polynomial …

A word automaton recognizing a language $ L $ is good for games (GFG) if its composition
with any game with winning condition $ L $ preserves the game's winner. While all …

In this paper, we give a self contained presentation of a recent breakthrough in the theory of
infinite duration games: the existence of a quasipolynomial time algorithm for solving parity …

Calude et al. have recently shown that parity games can be solved in quasi-polynomial time,
a landmark result that has led to several approaches with quasi-polynomial complexity …

We provide an algorithm to solve Rabin and Streett games over graphs with n vertices, m
edges, and k colours that runs in O~ mn (k!) 1+ o (1) time and O (nk log k log n) space …

We introduce the notion of universal graphs as a tool for constructing algorithms solving
games of infinite duration such as parity games and mean payoff games. In the first part we …

In this paper, we introduce open parity games, which is a compositional approach to parity
games. This is achieved by adding open ends to the usual notion of parity games. We …

The Strahler number of a rooted tree is the largest height of a perfect binary tree that is its
minor. The Strahler number of a parity game is proposed to be defined as the smallest …

We consider nested fixed-point expressions like μ z. ν y. μ x. f (x, y, z) evaluated over a finite
lattice, and ask how many queries to a function f are needed to find the value. The previous …