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 …

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 …

We study deterministic games of infinite duration played on graphs and focus on the strategy
complexity of quantitative objectives. Such games are known to admit optimal memoryless …

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 …

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 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 …

In this paper, we construct a winning condition W over a finite set of colors such that, first,
every finite arena has a strategy with 2 states of general memory which is optimal wrt W, and …

We study two-player zero-sum turn-based games on graphs, a framework of choice in
theoretical computer science. Such games model the possibly infinite interaction between a …

We study zero-sum turn-based games on graphs. In this note, we show the existence of a
game objective that is $\mathbf {\Pi}^ 0_3 $-complete for the Borel hierarchy and that is …