Related papers: The switch operators and push-the-button games: a …

The Parrondo effect describes the seemingly paradoxical situation in which two losing games can, when combined, become winning [Phys. Rev. Lett. 85, 24 (2000)]. Here we generalize this analysis to the case where both games are…

We consider various probabilistic games with piles for one player or two players. In each round of the game, a player randomly chooses to add $a$ or $b$ chips to his pile under the condition that $a$ and $b$ are not necessarily positive. If…

Repeated games have provided an explanation how mutual cooperation can be achieved even if defection is more favorable in a one-shot game in prisoner's dilemma situation. Recently found zero-determinant strategies have substantially been…

Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…

Zeckendorf proved that every positive integer can be expressed as the sum of non-consecutive Fibonacci numbers. This theorem inspired a beautiful game, the Zeckendorf Game. Two players begin with $n \ 1$'s and take turns applying rules…

In recent years methods have been proposed to extend classical game theory into the quantum domain. This paper explores further extensions of these ideas that may have a substantial potential for further research. Upon reformulating quantum…

We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly…

We study the complexity of computing the commuting-operator value $\omega^*$ of entangled XOR games with any number of players. We introduce necessary and sufficient criteria for an XOR game to have $\omega^* = 1$, and use these criteria to…

We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games to a concurrent setting where the two players choose moves simultaneously and independently at each state. For…

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…

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…

Mertens [In Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two general conjectures about repeated games: the first one is that, in any two-person zero-sum…

This document presents the rules of a tactical two-player board game which is inspired by spin glasses. The aim is, while placing bonds and spins, to achieve a majority of the spins facing the chosen direction of each player. The game has…

We introduce a topological combinatorial game called the Region Smoothing Swap Game. The game is played on a game board derived from the connected shadow of a link diagram on a (possibly non-orientable) surface by smoothing at crossings.…

Two-player games on graphs is central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can…

In a series of papers, G. Harmer and D. Abbott study the behavior of random walks associated with games introduced in 1997 by J. M. R. Parrondo. These games illustrate an apparent paradox that random and deterministic mixtures of losing…

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…

Two-player games have had a long and fruitful history of applications stretching across the social, biological, and physical sciences. Most applications of two-player games assume synchronous decisions or moves even when the games are…

Evolutionary game theory is a common framework to study the evolution of cooperation, where it is usually assumed that the same game is played in all interactions. Here, we investigate a model where the game that is played by two…

This paper introduces a new class of Dynkin games, where the two players are allowed to make their stopping decisions at a sequence of exogenous Poisson arrival times. The value function and the associated optimal stopping strategy are…