相关论文: Winning in Sequential Parrondo Games by Players wi…

We present a new form of a Parrondo game using discrete-time quantum walk on a line. The two players A and B with different quantum coins operators, individually losing the game can develop a strategy to emerge as joint winners by using…

Parrondo's paradox indicates a paradoxical situation in which a winning expectation may occur in sequences of losing games. There are many versions of the original Parrondo's games in the literature, but the games are played by two players…

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…

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…

Parrondo's paradox occurs 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. Several variations of…

Parrondo's Paradox arises when two losing games are combined to produce a winning one. A history dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by…

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…

We construct a Parrondo's game using discrete time quantum walks. Two lossing games are represented by two different coin operators. By mixing the two coin operators $U_{A}(\alpha_{A},\beta_{A},\gamma_{A})$ and…

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…

An analytical result and an algorithm are derived for the probability distribution of the one-dimensional cooperative Parrondo's games. We show that winning and the occurrence of the paradox depends on the number of players. Analytical…

Parrondo's paradox occurs 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. Several variations of…

Parrondo's paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually.Several…

The 1936 Mills Futurity slot machine had the feature that, if a player loses 10 times in a row, the 10 lost coins are returned. Ethier and Lee (2010) studied a generalized version of this machine, with 10 replaced by deterministic parameter…

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

Parrondo games with one-dimensional spatial dependence were introduced by Toral and extended to the two-dimensional setting by Mihailovi\'c and Rajkovi\'c. $MN$ players are arranged in an $M\times N$ array. There are three games, the fair,…

Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore,…

We present new versions of the Parrondo's paradox by which a losing game can be turned into winning by including a mechanism that allows redistribution of the capital amongst an ensemble of players. This shows that, for this particular…

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…

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 study a quantum walk in one-dimension using two different "coin" operators. By mixing two operators, both of which give a biased walk with negative expectation value for the walker position, it is possible to reverse the bias through…