Related papers: Playing Several Patterns Against One Another

We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect…

There are $n$ players who compete by timing their actions. An opportunity appears randomly on a time interval. Whoever takes an action the fastest after the opportunity has arisen wins. The occurrence of the opportunity is observed only…

We consider a two-player search game on a tree $T$. One vertex (unknown to the players) is randomly selected as the target. The players alternately guess vertices. If a guess $v$ is not the target, then both players are informed in which…

We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a…

Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…

The Warden's Game is a 2-player game, played with a row of coins. One player (the prisoner) wants to get all coins to show tails; the other player (the warden) wants to delay that as long as possible. At each turn, one player transfers the…

Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter…

In this paper the results of a simulation of a prisoner's dilemma robin-round tournament are presented. In the tournament each participating strategy plays an iterated prisoner's dilemma against each other strategy (round-robin) and as a…

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…

We analyze a game introduced by Andy Niedermaier, where $p$ players take turns throwing a dart at a dartboard. A player is eliminated unless his dart lands closer to the center than all previously thrown darts, in which case he goes to the…

Consider a rooted Galton-Watson tree $T$, to each of whose edges we assign, independently, a weight that equals $+1$ with probability $p_{1}$, $0$ with probability $p_{0}$ and $-1$ with probability $p_{-1}=1-p_{1}-p_{0}$. We play a game on…

We introduce a simple one-parameter game derived from a model describing the properties of a directed polymer in a random medium. At his turn, each of the two players picks a move among two alternatives in order to maximize his final score,…

A binary game is introduced and analysed. N players have to choose one of the two sides independently and those on the minority side win. Players uses a finite set of ad hoc strategies to make their decision, based on the past record. The…

Parrondo's paradox is about a paradoxical game and gambling where two probabilistic losing games can be combined to form a winning game. While the counter intuitive game is interesting in itself, it can be thought of a discrete version of…

We illustrate how one can use basic combinatorial theory and computer programming technique (Python) to analyze the combinatorial game: Mahjong. The results confirm some folklore concerning the game, and expose some unexpected results.…

We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to successfully interact with the opponent. While most previous…

Direct reciprocity is a well-known mechanism that could explain how cooperation emerges and prevails in an evolving population. Numerous prior researches have studied the emergence of cooperation in multiplayer games. However, most of them…

In this article, we look at a hat-guessing game, in which each player must guess the color of their own hat while only seeing the hats of the other players. We focus on the case of two hat colors and a countably infinite number of players.…

We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…

We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then…