Related papers: An update on domineering on rectangular boards
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…
The domination game is played on a graph G. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G dominated to that point in the game. Both players use an optimal…
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 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…
In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph $G$ and take it into a set $D$. The number of vertices dominated by the set $D$ must increase in each single turn and the game ends when $D$…
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $\mathcal{H}$ by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the…
We analyze the domination game, where two players, Dominator and Staller, construct together a dominating set M in a given graph, by alternately selecting vertices into M. Each move must increase the size of the dominated set. The players…
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectilinear grids. We describe a modular, mechanical game board,…
The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has not yet been chosen. Dominator wins if at some point the…
We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the…
Go gaming is a struggle for territory control between rival, black and white, stones on a board. We model the Go dynamics in a game by means of the Ising model whose interaction coefficients reflect essential rules and tactics employed in…
We study Maker--Breaker total domination game played by two players, Dominator and Staller, on the connected cubic graphs. Staller (playing the role of Maker) wins if she manages to claim an open neighbourhood of a vertex. Dominator wins…
Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duch\^ene, Gledel, Parreau, and Renault. Both games are instances of the combinatorial…
The minority game is a simple congestion game in which the players' main goal is to choose among two options the one that is adopted by the smallest number of players. We characterize the set of Nash equilibria and the limiting behavior of…
Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial…
A large class of Positional Games are defined on the complete graph on $n$ vertices. The players, Maker and Breaker, take the edges of the graph in turns, and Maker wins iff his subgraph has a given -- usually monotone -- property. Here we…
We introduce a two player game on an n x n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the number of queens already on the board which can attack that square modulo two.…
Decisions in a shareholder meeting or a legislative committee are often modeled as a weighted game. Influence of a member is then measured by a power index. A large variety of different indices has been introduced in the literature. This…
The Maker-Breaker domination game is played on a graph $G$ by two players, called Dominator and Staller. They alternately select an unplayed vertex in $G$. Dominator wins the game if he forms a dominating set while Staller wins the game if…
In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular,…