We study two-player multi-weighted reachability games played on a finite...
In this paper, we deepen the study of two-player Stackelberg games playe...
We propose two market designs for the optimal day-ahead scheduling of en...
Security is a subject of increasing attention in our actual society in o...
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an
in...
Priced timed games are two-player zero-sum games played on priced timed
...
Decisiveness has proven to be an elegant concept for denumerable Markov
...
We study multiplayer turn-based timed games with reachability objectives...
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an
in...
We consider multi-player games played on graphs, in which the players ai...
We study multiplayer reachability games played on a finite directed grap...
We study multiplayer quantitative reachability games played on a finite
...
The window mechanism was introduced by Chatterjee et al. [1] to strength...
We study multiplayer turn-based games played on a finite directed graph ...
We study multiplayer turn-based games played on a finite directed graph ...
We study multiplayer turn-based games played on a finite directed graph ...
We consider N-player non-zero sum games played on finite trees (i.e.,
se...