Add to ORKGTwo tokens are placed on vertices of a graph. At each time step, one token is chosen and is moved to a random neighboring point. In previous work, Tetali and Winkler studied the Angel strategy for bringing the tokens together as quickly as possible (on average), and the Demon strategy for delaying their collision as long as possible (on average). We build on these results by studying a game version of this process. In our game, two players take turns choosing the token to move. The Angel player hopes to bring the tokens together while the Demon player tries to keep them apart. We present optimal strategies for both players on stars, different types of directed cycles, and paths. Our proofs employ couplings of random walks as well as strateg...
We propose and study game-theoretic versions of independence in graphs. The games are played by two ...
We analyse the following random walk process inspired by the power-of-two-choice paradigm: starting ...
Simultaneous move games model discrete, multistage interactions where at each stage players simultan...
A token located at some vertex v of a connected, undirected graph G on n vertices is said to be taki...
We consider random-turn positional games, introduced by Peres, Schramm, Sheffield and Wilson in 2007...
AbstractWe apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving t...
Two-player games on graphs are widely studied in formal methods, as they model the interaction betwe...
We apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a unif...
In this thesis we study different non-cooperative two-person games. First, we study a zero-sum game ...
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to p...
In two-player games on graphs, the players move a token through a graph to produce an infinite path,...
We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter...
We consider the following two-player game on a graph. A token is located at a vertex, and the player...
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to p...
A simple stochastic game (SSG) is a game defined on a directed multigraph and played between players...
We propose and study game-theoretic versions of independence in graphs. The games are played by two ...
We analyse the following random walk process inspired by the power-of-two-choice paradigm: starting ...
Simultaneous move games model discrete, multistage interactions where at each stage players simultan...
A token located at some vertex v of a connected, undirected graph G on n vertices is said to be taki...
We consider random-turn positional games, introduced by Peres, Schramm, Sheffield and Wilson in 2007...
AbstractWe apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving t...
Two-player games on graphs are widely studied in formal methods, as they model the interaction betwe...
We apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a unif...
In this thesis we study different non-cooperative two-person games. First, we study a zero-sum game ...
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to p...
In two-player games on graphs, the players move a token through a graph to produce an infinite path,...
We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter...
We consider the following two-player game on a graph. A token is located at a vertex, and the player...
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to p...
A simple stochastic game (SSG) is a game defined on a directed multigraph and played between players...
We propose and study game-theoretic versions of independence in graphs. The games are played by two ...
We analyse the following random walk process inspired by the power-of-two-choice paradigm: starting ...
Simultaneous move games model discrete, multistage interactions where at each stage players simultan...