Related papers: Multi player Parrondo games with rigid coupling
We study pure coordination games where in every outcome, all players have identical payoffs, 'win' or 'lose'. We identify and discuss a range of 'purely rational principles' guiding the reasoning of rational players in such games and…
We introduce and analyze the ordered Zeckendorf game, a novel combinatorial two-player game inspired by Zeckendorf's Theorem, which guarantees a unique decomposition of every positive integer as a sum of non-consecutive Fibonacci numbers.…
We consider two-player iterated survival games in which players may switch from a more cooperative behavior to a less cooperative one at some step of the game. Payoffs are survival probabilities and lone individuals have to finish the game…
We study a complementarity game as a systematic tool for the investigation of the interplay between individual optimization and population effects and for the comparison of different strategy and learning schemes. The game randomly pairs…
We study a repeated game with payoff externalities and observable actions where two players receive information over time about an underlying payoff-relevant state, and strategically coordinate their actions. Players learn about the true…
We examine short combinatorial games for three or more players under a new play convention in which a player who cannot move on their turn is the unique loser. We show that many theorems of impartial and partizan two-player games under…
Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the…
Multi-round competitions often double or triple the points awarded in the final round, calling it a bonus, to maximize spectators' excitement. In a two-player competition with $n$ rounds, we aim to derive the optimal bonus size to maximize…
We use the indirect evolutionary approach to study evolutionarily stable preferences against multiple mutations in single- and multi-population matching settings, respectively. Players choose strategies to maximize their subjective…
We write the master equation describing the Parrondo's games as a consistent discretization of the Fokker--Planck equation for an overdamped Brownian particle describing a ratchet. Our expressions, besides giving further insight on the…
In a generalized tournament, players may have an arbitrary number of matches against each other and the outcome of the games is measured on a cardinal scale with a lower and upper bound. An axiomatic approach is applied to the problem of…
Domineering is a combinatorial game played on a subset of a rectangular grid between two players. Each board position can be put into one of four outcome classes based on who the winner will be if both players play optimally. In this note,…
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…
The basic social dilemma is frequently captured by a public goods game where participants decide simultaneously whether to support a common pool or not and after the enhanced contributions are distributed uniformly among all competitors.…
Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess a new form of equilibrium strategy, one…
In a function that takes its inputs from various players, the effect of a player measures the variation he can cause in the expectation of that function. In this paper we prove a tight upper bound on the number of players with large effect,…
In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. Such games and their strategies have been formalised in concurrent games based on event structures. However there are limitations in founding…
In this paper we unify, simplify, and extend previous work on the evolutionary dynamics of symmetric $N$-player matrix games with two pure strategies. In such games, gains from switching strategies depend, in general, on how many other…
The MandM Game involves two players who begin with I1 and I2 MandM's. During each round, each player tosses a fair coin: if the coin lands heads, that player eats one MandM, and if it lands tails, the player does not eat. If, at the end of…
In a vintage paper concerning Parsimonious games, a subset of constant sum homogeneous weighted majority games, Isbell introduced a twin relationship based on transposition properties of the incidence matrices upon minimal winning…