Parity games and universal graphs

10/11/2018
by   Thomas Colcombet, et al.
0

This paper is a contribution to the study of parity games and the recent constructions of three quasipolynomial time algorithms for solving them. We revisit a result of Czerwiński, Daviaud, Fijalkow, Jurdziński, Lazić, and Parys witnessing a quasipolynomial barrier for all three quasipolynomial time algorithms. The argument is that all three algorithms can be understood as constructing a so-called separating automaton, and to give a quasipolynomial lower bond on the size of separating automata. We give an alternative proof of this result. The key innovations of this paper are the notion of universal graphs and the idea of saturation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2021

The Theory of Universal Graphs for Infinite Duration Games

We introduce the notion of universal graphs as a tool for constructing a...
research
07/27/2018

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

Several distinct techniques have been proposed to design quasi-polynomia...
research
09/17/2021

New Algorithms for Combinations of Objectives using Separating Automata

The notion of separating automata was introduced by Bojanczyk and Czerwi...
research
12/17/2018

The complexity of mean payoff games using universal graphs

We study the computational complexity of solving mean payoff games. This...
research
01/29/2018

An Optimal Value Iteration Algorithm for Parity Games

The quest for a polynomial time algorithm for solving parity games gaine...
research
10/13/2020

Collapsible Pushdown Parity Games

This paper studies a large class of two-player perfect-information turn-...
research
04/14/2023

Solving Unique Games over Globally Hypercontractive Graphs

We study the complexity of affine Unique-Games (UG) over globally hyperc...

Please sign up or login with your details

Forgot password? Click here to reset