Related papers: A new heap game
When all the elements of the multiset $\{1,1,2,2,3,3,\ldots,k,k\}$ are placed in the cells of a $2\times k$ rectangular array, in how many configurations are exactly $v$ of the pairs directly over top one another, and exactly $h$ directly…
In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes faced with the following problem: how can a human (as opposed to a computer) shuffle a large deck of cards? The procedure we study is to break…
This paper studies the game of guessing riffle-shuffled cards with complete feedback. A deck of $n$ cards labelled 1 to $n$ is riffle-shuffled once and placed on a table. A player tries to guess the cards from top and is given complete…
This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…
We study the problem of finding Stackelberg equilibria in games with a massive number of players. So far, the only known game instances in which the problem is solved in polynomial time are some particular congestion games. However, a…
We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning…
Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…
We study two forms of a symmetric cooperative game played by three players, one classical and other quantum. In its classical form making a coalition gives advantage to players and they are motivated to do so. However in its quantum form…
Graph Pebbling is a well-studied single-player game on graphs. We introduce the game of Blocking Pebbles which adapts Graph Pebbling into a two-player strategy game in order to examine it within the context of Combinatorial Game Theory.…
In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In {\em bidding…
We study a two-player game played on undirected graphs called {\sc Trail Trap}, which is a variant of a game known as {\sc Partizan Edge Geography}. One player starts by choosing any edge and moving a token from one endpoint to the other;…
Two players alternate tossing a biased coin where the probability of getting heads is p. The current player is awarded alpha points for tails and alpha+beta for heads. The first player reaching n points wins. For a completely unfair coin…
Ultimate Tic-Tac-Toe is a variant of the popular Tic-Tac-Toe game. Two players compete to win three aligned "fields," with each field constituting its own miniature tic-tac-toe game. Each move determines which field the next player must…
An approach towards quantum games is proposed that uses the unusual probabilities involved in EPR-type experiments directly in two-player games.
We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen…
We consider 2-players, 2-values minimization games where the players' costs take on two values, $a,b$, $a<b$. The players play mixed strategies and their costs are evaluated by unimodal valuations. This broad class of valuations includes…
A partially parallel dynamical noisy binary choice (Ising) game in discrete time of $N$ players on complete graphs with $k$ players having a possibility of changing their strategies at each time moment called $k$-flip Ising game is…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
We propose a scheme for a quantum game based on performing an EPR type experiment and in which each player's spatial directional choices are considered as their strategies. A classical mixed-strategy game is recovered by restricting the…
In this paper we introduce a new game; in this game there are two players who play as rival pirate gangs. The goal is to gather more treasure than your rival. The game is played on a graph and a player gathers treasure by moving to an…