• Corpus ID: 52961389

Parity games and universal graphs

@article{Colcombet2018ParityGA,
  title={Parity games and universal graphs},
  author={Thomas Colcombet and Nathana{\"e}l Fijalkow},
  journal={ArXiv},
  year={2018},
  volume={abs/1810.05106}
}
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\'nski, Daviaud, Fijalkow, Jurdzi\'nski, Lazi\'c, 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… 
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
TLDR
The technical highlights are a quasi-polynomial lower bound on the size of universal ordered trees and a proof that every separating safety automaton has a universal tree hidden in its state space.
The complexity of mean payoff games using universal graphs
TLDR
It is shown that separating automata do not yield a quasipolynomial algorithm for solving mean payoff games, and tight bounds on the complexity of algorithms in this class are proved.
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
TLDR
It is shown that the linear dependence in the exponent in the number k of weights implies that universal graphs do not yield a quasipolynomial time algorithm for solving mean payoff games, implying that tight bounds on the complexity of algorithms formean payoff games using universal graphs are proved.
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games
TLDR
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 games and two new notions: good for small games automata and universal graphs.
A symmetric attractor-decomposition lifting algorithm for parity games
TLDR
The behaviour of the generic attractor-based algorithm of Jurdzinski and Morvan (2020) can be reproduced by a specific deceleration of the authors' symmetric lifting algorithm, in which some of the information collected by the algorithm is repeatedly discarded, further strengthening the ties between all known quasi-polynomial algorithms to date.
New Algorithms for Combinations of Objectives using Separating Automata
TLDR
It is shown that separating automata is a powerful tool for constructing algorithms solving games with combinations of objectives, and two new algorithms are constructed for disjunctions of parity and mean payoff objectives, matching the best known complexity.
Alternating Weak Automata from Universal Trees
TLDR
Any slightly better translation from alternating parity automata on infinite words to alternating weak automata would lead to algorithms for solving parity games that are asymptotically faster in the worst case than the current state of the art, and hence would yield a significant breakthrough.
The Theory of Universal Graphs for Infinite Duration Games
TLDR
The theory of universal graphs is developed, with two goals: showing an equivalence and normalisation result between different recently introduced related models, and constructing generic value iteration algorithms for any positionally determined objective.

References

SHOWING 1-9 OF 9 REFERENCES
An Optimal Value Iteration Algorithm for Parity Games
TLDR
The technical result of this paper is to show that the latter construction is asymptotically tight: universal trees have at least quasipolynomial size, suggesting that the succinct progress measure algorithm of Jurdzi\'nski and Lazi\'c is in this framework optimal, and that the polynomial time algorithm for parity games is hiding someplace else.
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
TLDR
A first implementation for a quasi-polynomial algorithm is provided, and a number of side results are provided, including minor algorithmic improvements, a quasi bi-linear complexity in the number of states and edges for a fixed number of colours, and matching lower bounds for the algorithm of Calude et al.
Small Progress Measures for Solving Parity Games
TLDR
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice.
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
TLDR
The technical highlights are a quasi-polynomial lower bound on the size of universal ordered trees and a proof that every separating safety automaton has a universal tree hidden in its state space.
A modal μ perspective on solving parity games in quasi-polynomial time
We present a new quasi-polynomial algorithm for solving parity games. It is based on a new bisimulation invariant measure of complexity for parity games, called the register-index, which captures the
A short proof of correctness of the quasi-polynomial time algorithm for parity games
TLDR
A short proof of correctness of the proposed quasi-polynomial time algorithm for parity games is proposed.
Succinct progress measures for solving parity games
  • M. Jurdzinski, R. Lazic
  • Computer Science
    2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2017
TLDR
An alternative quasi-polynomial time algorithm based on progress measures is devised, which allows the space required from quasi- polynomial to nearly linear, and a novel concept of ordered tree coding is introduced.
Deciding parity games in quasipolynomial time
TLDR
It is shown that the parity game can be solved in quasipolynomial time and it is proven that coloured Muller games with n nodes and m colours can be decided in time O((mm · n)5); it is also shown that this bound cannot be improved to O((2m · n), for any c, unless FPT = W[1].
An automata toolbox