Best response (BR) dynamics is a natural method by which players proceed toward a pure
Nash equilibrium via a local search method. The quality of the equilibrium reached may …

<? 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 …

Two-player zero-sum" graph games" are central in logic, verification, and multi-agent
systems. The game proceeds by placing a token on a vertex of a graph, and allowing the …

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 …

This paper is concerned with the selection and computation of pairwise stable networks
when agents have differentiable and concave utility functions. We show that a pairwise …

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 …

We study a very general cost-sharing scheduling game. An instance consists of k jobs and m
machines and an arbitrary weighted bipartite graph denoting the jobs strategies. An edge …

In resource allocation games, selfish players share resources that are needed in order to
fulfill their objectives. The cost of using a resource depends on the load on it. In the …

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 …