For decades, two-player (antagonistic) games on graphs have been a framework of choice
for many important problems in theoretical computer science. A notorious one is controller …

We consider zero-sum games on in nite graphs, with objectives speci ed as sets of in nite
words over some alphabet of colors. A well-studied class of objectives is the one of 𝜔 …

We study turn-based quantitative games of infinite duration opposing two antagonistic
players and played over graphs. This model is widely accepted as providing the adequate …

In two-player games on graphs, the simplest possible strategies are those that can be
implemented without any memory. These are called positional strategies. In this paper, we …

This paper is concerned with games of infinite duration played over potentially infinite
graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting …

Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in
theoretical computer science, notably as a framework for reactive synthesis. Optimal …

Two-player turn-based zero-sum games on (finite or infinite) graphs are a central framework
in theoretical computer science-notably as a tool for controller synthesis, but also due to their …

We study the computational complexity of solving stochastic games with mean-payoff
objectives. Instead of identifying special classes in which simple strategies are sufficient to …

Reachability objectives are arguably the most basic ones in the theory of games on graphs
(and beyond). But far from being bland, they constitute the cornerstone of this field …

In a parity game, Eve and Adam take turns in moving a token along the edges of a directed
graph, which are labelled by integers called priorities. This interaction results in an infinite …