The Theory of Universal Graphs for Infinite Duration Games
-
Published:2022-09-07
Issue:
Volume:Volume 18, Issue 3
Page:
-
ISSN:1860-5974
-
Container-title:Logical Methods in Computer Science
-
language:en
-
Short-container-title:
Author:
Colcombet Thomas,Fijalkow Nathanaël,Gawrychowski Paweł,Ohlmann Pierre
Abstract
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 develop the theory of universal graphs, 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. In the second part we
give four applications: to parity games, to mean payoff games, to a disjunction
between a parity and a mean payoff objective, and to disjunctions of several
mean payoff objectives. For each of these four cases we construct algorithms
achieving or improving over the best known time and space complexity.
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Half-Positional Objectives Recognized by Deterministic B\"uchi Automata;Logical Methods in Computer Science;2024-08-29
2. Positional ω-regular languages;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Playing Safe, Ten Years Later;Logical Methods in Computer Science;2024-01-29
4. Rabin Games and Colourful Universal Trees;Lecture Notes in Computer Science;2024