Graph games lie at the algorithmic core of many automated design problems in computer
science. These are games usually played between two players on a given graph, where the …

Sequential decision-making tasks often require satisfaction of multiple, partially-
contradictory objectives. Existing approaches are monolithic, where a single policy fulfills all …

A graph game proceeds as follows: two players move a token through a graph to produce a
finite or infinite path, which determines the payoff of the game. We study bidding games in …

In a two-player zero-sum graph game, the players move a token throughout a graph to
produce an infinite play, which determines the winner of the game. Bidding games are graph …

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 …

We consider bidding games, a class of two-player zero-sum graph games. The game
proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a …

A graph game is a two-player zero-sum game in which the players move a token throughout
a graph to produce an infinite path, which determines the winner or payoff of the game. In …

Graph games are fundamental in strategic reasoning of multi-agent systems and their
environments. We study a new family of graph games which combine stochastic …

A graph game is a two-player zero-sum game in which the players move a token throughout
a graph to produce an infinite path, which determines the winner or payoff of the game. In …

The interaction among components in a system is traditionally modeled by a game. In the
turned-based setting, the players in the game jointly move a token along the game graph …