Related papers: Black & White Nim games

We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations…

The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from…

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…

The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the cost incurred between occurrences of odd colors and the next occurrence of a larger even one. Such games quantitatively extend parity games…

This paper presents a new partial two-player game, called the \emph{cannibal animal game}, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first…

In chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can a explicit…

Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…

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 work, we introduce a new toolkit for analyzing cloning games, a notion that captures stronger and more quantitative versions of the celebrated quantum no-cloning theorem. This framework allows us to analyze a new cloning game based…

Repetition-based draw rules in deterministic games like chess ensure termination but introduce strategic artifacts, allowing players to enforce draws independent of positional value. We propose an asymmetric modification: threefold…

We prove that the difference between the paint number and the choice number of a complete bipartite graph $K_{N,N}$ is $\Theta(\log \log N )$. That answers the question of Zhu (2009) whether this difference, for all graphs, can be bounded…

In this article, we introduce a notion of size for sets called thickness that can be used to guarantee that two Cantor sets intersect (the Gap Lemma), and show a connection among Thickness, Schmidt Games and Patterns. We work mostly in the…

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…

We unify and consolidate various results about non-signall-ing games, a subclass of non-local two-player one-round games, by introducing and studying several new families of games and establishing general theorems about them, which extend a…

For a sequence $(H_i)_{i=1}^k$ of graphs, let $\textrm{nim}(n;H_1,\ldots, H_k)$ denote the maximum number of edges not contained in any monochromatic copy of $H_i$ in colour $i$, for any colour $i$, over all $k$-edge-colourings of~$K_n$.…

We shall deal comprehensively with Black Boxes, the intention being that provably in ZFC we have a sequence of guesses of extra structure on small subsets, where the guesses are pairwise almost disjoint; by this we mean they have quite…

We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size s_i \in [0,1] and a color c_i \in C, where C is a set…

Consider a situation with $n$ agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can decide whether coalitions are successful (winning) or not…

In his list of open problems, Martin Erickson described a certain game: "Two players alternately put queens on an n x n chess board so that each new queen is not in range of any queen already on the board (the color of the queens is…

Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to…