We study multiplayer quantitative reachability games played on a finite directed graph,
where the objective of each player is to reach his target set of vertices as quickly as possible …

We consider two-player non zero-sum infinite duration games played on weighted graphs.
We extend the notion of secure equilibrium introduced by Chatterjee et al., from the Boolean …

<? tight?> Two-player games on graphs are widely studied in formal methods, as they model
the interaction between a system and its environment. The game is played by moving a …

The concept of subgame perfect ϵ ϵ-equilibrium (ϵ ϵ-SPE), where ϵ ϵ is an error-term, has
in recent years emerged as a prominent solution concept for perfect information games of …

We study $ n $-player turn-based games played on a finite directed graph. For each play,
the players have to pay a cost that they want to minimize. Instead of the well-known notion of …

In two-player games on graphs, the players move a token through a graph to produce an
infinite path, which determines the winner of the game. Such games are central in formal …

In two-player games on graphs, the players move a token through a graph to produce an
infinite path, which determines the winner or payoff of the game. Such games are central in …

Classical network-formation games are played on a directed graph. Players have
reachability objectives: each player has to select a path from his source to target vertices …

Network games (NGs) are played on directed graphs and are extensively used in network
design and analysis. Search problems for NGs include finding special strategy profiles such …

Classical network-formation games (NFGs) are played on directed graphs, and are used in
network design and analysis. Edges in the network are associated with costs and players …