Related papers: On the Constructor-Blocker Game
We study biased {\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker…
A graph $G = (V,E)$ is said to be saturated with respect to a monotone increasing graph property ${\mathcal P}$, if $G \notin {\mathcal P}$ but $G \cup \{e\} \in {\mathcal P}$ for every $e \in \binom{V}{2} \setminus E$. The saturation game…
Maker-Breaker games are played on a hypergraph $(X,\mathcal{F})$, where $\mathcal{F} \subseteq 2^X$ denotes the family of winning sets. Both players alternately claim a predefined amount of edges (called bias) from the board $X$, and Maker…
We study the Maker-Breaker tournament game played on the edge set of a given graph $G$. Two players, Maker and Breaker claim unclaimed edges of $G$ in turns, and Maker wins if by the end of the game she claims all the edges of a pre-defined…
The Maker-Breaker domination game (MBD game) is a two-player game played on a graph $G$ by Dominator and Staller. They alternately select unplayed vertices of $G$. The goal of Dominator is to form a dominating set with the set of vertices…
In the $(a,b)$-biased Maker-Breaker domination game, two players alternately select unplayed vertices in a graph $G$ such that Dominator selects $a$ and Staller selects $b$ vertices per move. Dominator wins if the vertices he selected…
We consider the following two-player game, parametrised by positive integers $n$ and $k$. The game is played between Painter and Builder, alternately taking turns, with Painter moving first. The game starts with the empty graph on $n$…
The total domination game is a two-person competitive optimization game, where the players, Dominator and Staller, alternately select vertices of an isolate-free graph $G$. Each vertex chosen must strictly increase the number of vertices…
We investigate Maker-Breaker games on graphs of size $\aleph_1$ in which Maker's goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the game on the axiomatic framework. Relating to this, we prove…
In the graph sharing game, two players share a connected graph $G$ with non-negative weights assigned to the vertices, claiming and collecting the vertices of $G$ one by one, while keeping the set of all claimed vertices connected through…
The Maker-Breaker connectivity game and Hamilton cycle game belong to the best studied games in positional games theory, including results on biased games, games on random graphs and fast winning strategies. Recently, the Connector-Breaker…
We study the biased $(2:b)$ Walker--Breaker games, played on the edge set of the complete graph on $n$ vertices, $K_n$. These games are a variant of the Maker--Breaker games with the restriction that Walker (playing the role of Maker) has…
Let $(X, \mathcal{F})$ be a hypergraph. The Maker-Breaker game on $(X, \mathcal{F})$ is a combinatorial game between two players, Maker and Breaker. Beginning with Maker, the players take turns claiming vertices from $X$ that have not yet…
We investigate games played between Maker and Breaker on an infinite complete graph whose vertices are coloured with colours from a given set, each colour appearing infinitely often. The players alternately claim edges, Makers aim being to…
The classical Maker-Breaker positional game is played on a board which is a hypergraph $\mathcal{H}$, with two players, Maker and Breaker, alternately claiming vertices of $\mathcal{H}$ until all the vertices are claimed. When the game…
We introduce a model of a controlled random graph process. In this model, the edges of the complete graph $K_n$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably,…
The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each…
In this paper, we construct two hypergraphs which exhibit the following properties. We first construct a hypergraph $G_{CP}$ and show that Breaker wins the Maker-Breaker game on $G_{CP}$, but Chooser wins the Chooser-Picker game on…
We consider a biased version of Maker-Breaker domination games, which were recently introduced by Gledel, Ir{\v{s}}i{\v{c}}, and Klav{\v{z}}ar. Two players, Dominator and Staller, alternatingly claim vertices of a graph $G$ where Dominator…
We study the unbiased WalkerMaker-WalkerBreaker games on the edge set of the complete graph on $n$ vertices, $K_n$, a variant of well-known Maker-Breaker positional games, where both players have the restriction on the way of playing.…