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 …

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 …

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 …

We study transformations of automata and games using Muller conditions into equivalent
ones using parity or Rabin conditions. We present two transformations, one that turns a …

We study the existence of positional strategies for the protagonist in infinite duration games
over arbitrary game graphs. We prove that prefix-independent objectives in {\Sigma} _0^ 2 …

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

Kopczy\'{n} ski (ICALP 2006) conjectured that prefix-independent half-positional winning
conditions are closed under finite unions. We refute this conjecture over finite arenas. For …

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 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 half-positional if,
in all games using $ L $ as winning objective, the protagonist can play optimally using …