We investigate concurrent two-player win/lose stochastic games on finite...
This paper studies two-player zero-sum games played on graphs and makes
...
Timed automata have been introduced by Rajeev Alur and David Dill in the...
A central question in the theory of two-player games over graphs is to
u...
We study two-player concurrent stochastic games on finite graphs, with
B...
We study two-player reachability games on finite graphs. At each state t...
We consider zero-sum games on infinite graphs, with objectives specified...
We study infinite two-player win/lose games (A,B,W) where A,B are finite...
In general, finite concurrent two-player reachability games are only
det...
We study stochastic zero-sum games on graphs, which are prevalent tools ...
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an
in...
Decisiveness has proven to be an elegant concept for denumerable Markov
...
Concurrent games with a fixed number of agents have been thoroughly stud...
The problem of distributed synthesis is to automatically generate a
dist...
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an
in...
For decades, two-player (antagonistic) games on graphs have been a frame...
Broadcast networks allow one to model networks of identical nodes
commun...
We study pure Nash equilibria in infinite-duration games on graphs, with...
Temporal logics are extensively used for the specification of on-going
b...
We propose a formal model of distributed computing based on register aut...
In this paper, we are interested in the synthesis of schedulers in
doubl...
We study Nash equilibria in games on graphs with an imperfect monitoring...
This volume contains the proceedings of the Eighth International Symposi...
Computing steady-state distributions in infinite-state stochastic system...