Related papers: Parrondo games with spatial dependence

We consider a deterministic realization of Parrondo games and use periodic orbit theory to analyze their asymptotic behavior.

We study the mathematical properties of probabilistic processes in which the independent actions of $n$ players (`causes') can influence the outcome of each player (`effects'). In such a setting, each pair of outcomes will generally be…

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…

The Parrondo's paradox is a counterintuitive phenomenon in which individually losing strategies, canonically termed game A and game B, are combined to produce winning outcomes. In this paper, a co-evolution of game dynamics and network…

The multiplication game is a two-person game in which each player chooses a positive integer without knowledge of the other player's number. The two numbers are then multiplied together and the first digit of the product determines the…

A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is…

We study a spatial Prisoner's dilemma game with two types (A and B) of players located on a square lattice. Players following either cooperator or defector strategies play Prisoner's Dilemma games with their 24 nearest neighbors. The…

We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the technique of Martin (1998) and Maitra and Sudderth (1998), we show…

We introduce nonlinear attractive effects into a spatial Prisoner's Dilemma game where the players located on a square lattice can either cooperate with their nearest neighbors or defect. In every generation, each player updates its…

Projection games constitute an important class of nonlocal games where, for any answer from the first player, there is a unique correct answer for the second player. This class of games captures nonlocal games arising from constraint…

Parrondo's paradox is extended to regime switching random walks in random environments. The paradoxical behavior of the resulting random walk is explained by the effect of the random environment. Full characterization of the asymptotic…

We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…

We analyze a coin-based game with two players where, before starting the game, each player selects a string of length $n$ comprised of coin tosses. They alternate turns, choosing the outcome of a coin toss according to specific rules. As a…

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…

We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…

We study the emergence of altruistic behaviour in collective games. In particular, we take into account Toral's version of collective Parrondo's paradoxical games, in which the redistribution of capital between agents, who can play…

We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same…

Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we…

We consider a collective version of Parrondo's games with probabilities parametrized by rho in (0,1) in which a fraction phi in (0,1] of an infinite number of players collectively choose and individually play at each turn the game that…

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,…