It is shown that the parity game can be solved in quasipolynomial time. The parameterised
parity game-with n nodes and m distinct values (aka colours or priorities)-is proven to be in …

Classical analysis of two-player quantitative games involves an adversary (modeling the
environment of the system) which is purely antagonistic and asks for strict guarantees while …

A controller is a device that interacts with a plant. At each time point, it reads the plant's state
and issues commands with the goal that the plant operates optimally. Constructing optimal …

We propose a general framework for modelling and formal reasoning about multi-agent
systems and, in particular, multi-stage games where both quantitative and qualitative …

We study two-player stochastic games, where the goal of one player is to satisfy a formula
given as a positive boolean combination of expected total reward objectives and the …

We study a natural problem about rational behaviors in multiplayer non-zero-sum sequential
infinite duration games played on graphs: rational verification, that consists in deciding …

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 generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from
multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the …

We study strategy synthesis for stochastic two-player games with multiple objectives
expressed as a conjunction of LTL and expected total reward goals. For stop** games, the …

The classical LTL synthesis problem is purely qualitative: the given LTL specification is
realized or not by a reactive system. LTL is not expressive enough to formalize the …