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 …

In this paper, we relate the problem of determining the chromatic memory requirements of
Muller conditions with the minimisation of transition-based Rabin automata. Our first …

This paper studies two-player zero-sum games played on graphs and makes contributions
toward the following question: given an objective, how much memory is required to play …

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 …

We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-
making in presence of an antagonistic opponent in a random environment. In this setting, an …

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

We consider two-player games over graphs and give tight bounds on the memory size of
strategies ensuring safety objectives. More specifically, we show that the minimal number of …

In the context of two-player games over graphs, a language L is called positional if, in all
games using L as winning objective, the protagonist can play optimally using positional …