Related papers: How strong can the Parrondo effect be? II
If the parameters of the original Parrondo games $A$ and $B$ are allowed to be arbitrary, subject to a fairness constraint, and if the two (fair) games $A$ and $B$ are played in an arbitrary periodic sequence, then the rate of profit can…
Toral introduced so-called cooperative Parrondo games, in which there are N players (3 or more) arranged in a circle. At each turn one player is randomly chosen to play. He plays either game A or game B, depending on the strategy. Game A…
Toral introduced so-called cooperative Parrondo games, in which there are N players (3 or more) arranged in a circle. At each turn one player is randomly chosen to play. He plays either game A or game B. Game A results in a win or loss of…
The original Parrondo game, denoted as AB3, contains two independent games: A and B. The winning or losing of A and B game is defined by the change of one unit of capital. Game A is a losing game if played continuously, with winning…
Parrondo games with spatial dependence were introduced by Toral (2001) and have been studied extensively. In Toral's model, $N$ players are arranged in a circle. The players play either game $A$ or game $B$. In game $A$, a randomly chosen…
Let game B be Toral's cooperative Parrondo game with (one-dimensional) spatial dependence, parameterized by N (3 or more) and p_0,p_1,p_2,p_3 in [0,1], and let game A be the special case p_0=p_1=p_2=p_3=1/2. Let mu_B (resp., mu_(1/2,1/2))…
Toral (2002) considered an ensemble of N\geq2 players. In game B a player is randomly selected to play Parrondo's original capital-dependent game. In game A' two players are randomly selected without replacement, and the first transfers one…
Parrondo games with spatial dependence were introduced by Toral (2001) and have been studied extensively. In Toral's model $N$ players are arranged in a circle. The players play either game $A$ or game $B$. In game $A$, a randomly chosen…
Inspired by the flashing ratchet, Parrondo's game presents an apparently paradoxical situation. Parrondo's game consists of two individual games, game A and game B. Game A is a slightly losing coin-tossing game. Game B has two coins, with…
We present some new analytical expressions for the so-called Parrondo effect, where simple coin-flipping games with negative expected value are combined into a winning game. Parrondo games are state-dependent. By identifying the game state…
That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…
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…
Parrondo's paradox refers to the counter-intuitive situation where a winning strategy results from a suitable combination of losing ones. Simple stochastic games exhibiting this paradox have been introduced around the turn of the…
This paper investigates the different effects of chaotic switching on Parrondo's games, as compared to random and periodic switching. The rate of winning of Parrondo's games with chaotic switching depends on coefficient(s) defining the…
Let game B be Toral's cooperative Parrondo game with (one-dimensional) spatial dependence, parameterized by N (3 or more) and p_0, p_1, p_2, p_3 in [0,1], and let game A be the special case p_0=p_1=p_2=p_3=1/2. In previous work we…
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…
We study a modification of the so-called Parrondo's paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own…
In the original Parrondo game, a single player combines two losing strategies to a winning strategy. In this paper we investigate the question what happens, if two or more players play Parrondo games in a coordinated way. We introduce a…
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…
Parrondo's paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version…