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 provide an algorithm to solve Rabin and Streett games over graphs with n vertices, m
edges, and k colours that runs in O~ mn (k!) 1+ o (1) time and O (nk log k log n) space …

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 …

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 …

We present a polynomial-time reduction from max-average constraints to the feasibility
problem for semidefinite programs. This shows that Condon's simple stochastic games …

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 …

In two player games seen so far, players had objectives that are opposite to each other's, so
we were able to define them giving only Eve's objective. Adam was seen as a purely …