相关论文: Parrondo's effects with aperiodic protocols
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…
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…
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…
The Parrondo's paradox is a counterintuitive phenomenon where individually-losing strategies can be combined in producing a winning expectation. In this paper, the issues surrounding the Parrondo's paradox are investigated. The focus is…
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…
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))…
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…
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…
We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at…
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…
Parrondo's coin-tossing games comprise two games, $A$ and $B$. The result of game $A$ is determined by the toss of a fair coin. The result of game $B$ is determined by the toss of a $p_0$-coin if capital is a multiple of $r$, and by the…
Parrondo's games manifest the apparent paradox where losing strategies can be combined to win and have generated significant multidisciplinary interest in the literature. Here we review two recent approaches, based on the Fokker-Planck…
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…
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…
Parrondo's paradox is a well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones. In this paper, we study one-dimensional discrete-time quantum walks, manipulating two different…
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…
On markets with receding prices, artificial noise traders may consider alternatives to buy-and-hold. By simulating variations of the Parrondo strategy, using real data from the Swedish stock market, we produce first indications of 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…
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…
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…