The objective of this collaborative textbook is to present the state of ...
This paper studies two-player zero-sum games played on graphs and makes
...
The window mechanism, introduced by Chatterjee et al. for mean-payoff an...
A central question in the theory of two-player games over graphs is to
u...
Two-player (antagonistic) games on (possibly stochastic) graphs are a
pr...
We consider zero-sum games on infinite graphs, with objectives specified...
The window mechanism was introduced by Chatterjee et al. to reinforce
me...
We study stochastic zero-sum games on graphs, which are prevalent tools ...
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an
in...
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an
in...
For decades, two-player (antagonistic) games on graphs have been a frame...
We consider the verification of multiple expected reward objectives at o...
In this paper, we study one-player and two-player energy mean-payoff gam...
The window mechanism was introduced by Chatterjee et al. [1] to strength...
In this paper, we are interested in the synthesis of schedulers in
doubl...
We study finite-memory (FM) determinacy in games on finite graphs, a cen...
The beyond worst-case synthesis problem was introduced recently by Bruyè...