Related papers: A vertex and edge deletion game on graphs
The network coloring game has been proposed in the literature of social sciences as a model for conflict-resolution circumstances. The players of the game are the vertices of a graph with $n$ vertices and maximum degree $\Delta$. The game…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
The isolation game is played on a graph $G$ by two players who take turns playing a vertex such that if $X$ is the set of already played vertices, then a vertex can be selected only if it dominates a vertex from a nontrivial component of $G…
Eternal vertex cover is the following two-player game between a defender and an attacker on a graph. Initially, the defender positions k guards on k vertices of the graph; the game then proceeds in turns between the defender and the…
In order to find Hamiltonian cycle, algorithm should find edges that creates a Hamiltonian cycle. Higher number of edges creates more possibilities to check to solve the problem. Algorithm rests on analysis of original graph and opposite…
We study the positional game where two players, Maker and Breaker, alternately select respectively $1$ and $b$ previously unclaimed edges of $K_n$. Maker wins if she succeeds in claiming all edges of some odd cycle in $K_n$ and Breaker wins…
Motivated by the controller placement problems in software-defined networks and the fair division principles of classical "cake cutting", we investigate the following two-player zero-sum game. In our model, a defender places a limited…
We study a variant of the Cops and Robbers game on graphs in which the robbers damage the visited vertices, aiming to maximize the number of damaged vertices. For that game with one cop against $s$ robbers a conjecture was made by Carlson,…
The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a…
The deduction game may be thought of as a variant on the classical game of cops and robber in which the cops (searchers) aim to capture an invisible robber (evader); each cop is allowed to move at most once, and cops situated on different…
First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of…
We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the…
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 token throughout a graph to produce an infinite path. There are several…
We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high…
We study the (1:b) Maker-Breaker component game, played on the edge set of a d-regular graph. Maker's aim in this game is to build a large connected component, while Breaker's aim is to not let him do so. For all values of Breaker's bias b,…
We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.
We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph ${\mathcal G}(n,p)$. In each round of the $(1 : q)$ Waiter-Client Hamiltonicity game, the first player,…
In this paper we introduce and study {\em all-pay bidding games}, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn,…
We study a variant of the chip-firing game called the diffusion game. In the diffusion game, we begin with some integer labelling of the vertices of a graph, interpreted as a number of chips on each vertex, and then for each subsequent step…
In a $(1:b)$ Maker-Breaker game, a primary question is to find the maximal value of $b$ that allows Maker to win the game (that is, the critical bias $b^*$). Erd\H{o}s conjectured that the critical bias for many Maker-Breaker games played…