Related papers: High Temperature Domineering Positions
We present constructions regarding the general behaviour of biased positional games, and amongst others show that the outcome of such a game can differ in an arbitrary way depending on which player starts the game, and that fair biased…
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…
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…
In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must…
Positional games are a mathematical class of two-player games comprising Tic-tac-toe and its generalizations. We propose a novel encoding of these games into Quantified Boolean Formulas (QBFs) such that a game instance admits a winning…
When are all positions of a game numbers? We show that two properties are necessary and sufficient. These properties are consequences of that, in a number, it is not an advantage to be the first player. One of these properties implies the…
We introduce the following class of partizan games, called pomax games. Given a partially ordered set whose elements are colored black or white, the players Black and White take turns removing any maximal element of their own color. If…
In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…
Let $\gamma_g(G)$ be the game domination number of a graph $G$. It is proved that if ${\rm diam}(G) = 2$, then $\gamma_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(G)}{11}\right\rfloor$. The bound is attained: if…
Circular Nim is a two-player impartial combinatorial game consisting of $n$ stacks of tokens placed in a circle. A move consists of choosing $k$ consecutive stacks and taking at least one token from one or more of the stacks. The last…
A particular, two-dimensional, tiling model, composed by the so called Wang tiles has been studied at finite temperature by Monte Carlo numerical simulations. In absence of any thermal bath the Wang tiles give the opportunity of building a…
We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…
Consider the following game between a random player R and a deterministic player D. There is a pile of n elements at the beginning. The rules for playing are as follows: In each turn of R, if the pile contains exactly m elements, R removes…
I demonstrate a pairing mechanism of dopants in a magnetic lattice, emerging from the underlying high-temperature disorder of the spins. The effect is demonstrated in a mixed-dimensional model, where dopants travel along a two-leg ladder,…
How cooperation can evolve between players is an unsolved problem of biology. Here we use Hamiltonian dynamics of models of the Ising type to describe populations of cooperating and defecting players to show that the equilibrium fraction of…
We examine the temperature dependence of the magnetic ordering in the frustrated Heisenberg $J_1-J_2$ model in presence of two different kind of dopants: vacancies or magnetic impurities. We demonstrate that, irrespective to their magnetic…
A comparative study of high and zero temperature plasma for the case of damping rate, drag and diffusion coefficients have been presented. In each of these quantities, it is revealed how the magnetic interaction dominates over the electric…
The \emph{stationary set splitting game} is a game of perfect information of length $\omega_{1}$ between two players, \unspls and \spl, in which \unspls chooses stationarily many countable ordinals and \spls tries to continuously divide…
We study a modified prisoner's dilemma game taking place on two-dimensional disordered square lattices. The players are pure strategists and can either cooperate or defect with their immediate neighbors. In the generations each player…
Chip-firing is a combinatorial game played on a graph in which we place and disperse chips on vertices until a stable state is reached. We study a chip-firing variant played on an infinite rooted directed $k$-ary tree, where we place…