Parrondo's paradox

Parrondo's paradox, a paradox in game theory, has been described as: A combination of losing strategies becomes a winning strategy. It is named after its creator, Juan Parrondo, who discovered the paradox in 1996. A more explanatory description is:

There exist pairs of games, each with a higher probability of losing than winning, for which it is possible to construct a winning strategy by playing the games alternately.

Parrondo devised the paradox in connection with his analysis of the Brownian ratchet, a thought experiment about a machine that can purportedly extract energy from random heat motions popularized by physicist Richard Feynman. However, the paradox disappears when rigorously analyzed.^[1]

Probability space of Parrondo’s paradox from Shu & Wang, 2014.^[1]

Illustrative examples

The saw-tooth example

Figure 1

Consider an example in which there are two points A and B having the same altitude, as shown in Figure 1. In the first case, we have a flat profile connecting them. Here, if we leave some round marbles in the middle that move back and forth in a random fashion, they will roll around randomly but towards both ends with an equal probability. Now consider the second case where we have a saw-tooth-like region between them. Here also, the marbles will roll towards either ends with equal probability (if there were a tendency to move in one direction, marbles in a ring of this shape would tend to spontaneously extract thermal energy to revolve, violating the second law of thermodynamics). Now if we tilt the whole profile towards the right, as shown in Figure 2, it is quite clear that both these cases will become biased towards B.

Now consider the game in which we alternate the two profiles while judiciously choosing the time between alternating from one profile to the other.

Figure 2

When we leave a few marbles on the first profile at point E, they distribute themselves on the plane showing preferential movements towards point B. However, if we apply the second profile when some of the marbles have crossed the point C, but none have crossed point D, we will end up having most marbles back at point E (where we started from initially) but some also in the valley towards point A given sufficient time for the marbles to roll to the valley. Then we again apply the first profile and repeat the steps (points C, D and E now shifted one step to refer to the final valley closest to A). If no marbles cross point C before the first marble crosses point D, we must apply the second profile shortly before the first marble crosses point D, to start over.

It easily follows that eventually we will have marbles at point A, but none at point B. Hence for a problem defined with having marbles at point A being a win and having marbles at point B a loss, we clearly win by playing two losing games.

The coin-tossing example

A second example of Parrondo's paradox is drawn from the field of gambling. Consider playing two games, Game A and Game B with the following rules. For convenience, define $C_{t}$ to be our capital at time t, immediately before we play a game.

Winning a game earns us $1 and losing requires us to surrender $1. It follows that $C_{{t+1}}=C_{t}+1$ if we win at step t and $C_{{t+1}}=C_{t}-1$ if we lose at step t.
In Game A, we toss a biased coin, Coin 1, with probability of winning $P_{1}=(1/2)-\epsilon$ . If $\epsilon >0$ , this is clearly a losing game in the long run.
In Game B, we first determine if our capital is a multiple of some integer $M$ . If it is, we toss a biased coin, Coin 2, with probability of winning $P_{2}=(1/10)-\epsilon$ . If it is not, we toss another biased coin, Coin 3, with probability of winning $P_{3}=(3/4)-\epsilon$ . The role of modulo $M$ provides the periodicity as in the ratchet teeth.

It is clear that by playing Game A, we will almost surely lose in the long run. Harmer and Abbott^[2] show via simulation that if $M=3$ and $\epsilon =0.005,$ Game B is an almost surely losing game as well. In fact, Game B is a Markov chain, and an analysis of its state transition matrix (again with M=3) shows that the steady state probability of using coin 2 is 0.3836, and that of using coin 3 is 0.6164.^[3] As coin 2 is selected nearly 40% of the time, it has a disproportionate influence on the payoff from Game B, and results in it being a losing game.

However, when these two losing games are played in some alternating sequence - e.g. two games of A followed by two games of B (AABBAABB...), the combination of the two games is, paradoxically, a winning game. Not all alternating sequences of A and B result in winning games. For example, one game of A followed by one game of B (ABABAB...) is a losing game, while one game of A followed by two games of B (ABBABB...) is a winning game. This coin-tossing example has become the canonical illustration of Parrondo's paradox – two games, both losing when played individually, become a winning game when played in a particular alternating sequence. The apparent paradox has been explained using a number of sophisticated approaches, including Markov chains,^[4] flashing ratchets,^[5] Simulated Annealing^[6] and information theory.^[7] One way to explain the apparent paradox is as follows:

While Game B is a losing game under the probability distribution that results for $C_{t}$ modulo $M$ when it is played individually ( $C_{t}$ modulo $M$ is the remainder when $C_{t}$ is divided by $M$ ), it can be a winning game under other distributions, as there is at least one state in which its expectation is positive.
As the distribution of outcomes of Game B depend on the player's capital, the two games cannot be independent. If they were, playing them in any sequence would lose as well.

The role of $M$ now comes into sharp focus. It serves solely to induce a dependence between Games A and B, so that a player is more likely to enter states in which Game B has a positive expectation, allowing it to overcome the losses from Game A. With this understanding, the paradox resolves itself: The individual games are losing only under a distribution that differs from that which is actually encountered when playing the compound game. In summary, Parrondo's paradox is an example of how dependence can wreak havoc with probabilistic computations made under a naive assumption of independence. A more detailed exposition of this point, along with several related examples, can be found in Philips and Feldman.^[8]

A simplified example

For a simpler example of how and why the paradox works, again consider two games Game A and Game B, this time with the following rules:

In Game A, you simply lose $1 every time you play.
In Game B, you count how much money you have left. If it is an even number, you win $3. Otherwise you lose $5.

Say you begin with $100 in your pocket. If you start playing Game A exclusively, you will obviously lose all your money in 100 rounds. Similarly, if you decide to play Game B exclusively, you will also lose all your money in 100 rounds.

However, consider playing the games alternatively, starting with Game B, followed by A, then by B, and so on (BABABA...). It should be easy to see that you will steadily earn a total of $2 for every two games.

Thus, even though each game is a losing proposition if played alone, because the results of Game B are affected by Game A, the sequence in which the games are played can affect how often Game B earns you money, and subsequently the result is different from the case where either game is played by itself.

Application

Parrondo's paradox is used extensively in game theory, and its application in engineering, population dynamics,^[9] financial risk, etc., are also being looked into as demonstrated by the reading lists below. Parrondo's games are of little practical use such as for investing in stock markets^[10] as the original games require the payoff from at least one of the interacting games to depend on the player's capital. However, the games need not be restricted to their original form and work continues in generalizing the phenomenon. Similarities to volatility pumping and the two-envelope problem^[11] have been pointed out. Simple finance textbook models of security returns have been used to prove that individual investments with negative median long-term returns may be easily combined into diversified portfolios with positive median long-term returns.^[12] Similarly, a model that is often used to illustrate optimal betting rules has been used to prove that splitting bets between multiple games can turn a negative median long-term return into a positive one.^[13] In evolutionary biology, both bacterial random phase variation^[14] and the evolution of less accurate sensors^[15] have been modelled and explained in terms of the paradox.

Name

In the early literature on Parrondo's paradox, it was debated whether the word 'paradox' is an appropriate description given that the Parrondo effect can be understood in mathematical terms. The 'paradoxical' effect can be mathematically explained in terms of a convex linear combination.

However, Derek Abbott, a leading Parrondo's paradox researcher provides the following answer regarding the use of the word 'paradox' in this context:

Is Parrondo's paradox really a "paradox"? This question is sometimes asked by mathematicians, whereas physicists usually don't worry about such things. The first thing to point out is that "Parrondo's paradox" is just a name, just like the "Braess' paradox" or "Simpson's paradox." Secondly, as is the case with most of these named paradoxes they are all really apparent paradoxes. People drop the word "apparent" in these cases as it is a mouthful, and it is obvious anyway. So no one claims these are paradoxes in the strict sense. In the wide sense, a paradox is simply something that is counterintuitive. Parrondo's games certainly are counterintuitive—at least until you have intensively studied them for a few months. The truth is we still keep finding new surprising things to delight us, as we research these games. I have had one mathematician complain that the games always were obvious to him and hence we should not use the word "paradox." He is either a genius or never really understood it in the first place. In either case, it is not worth arguing with people like that.

Parrondo's paradox does not seem that paradoxical if one notes that it is actually a combination of three simple games: two of which have losing probabilities and one of which has a high probability of winning. To suggest that one can create a winning strategy with three such games is neither counterintuitive nor paradoxical.

References

1 2 Shu, Jian-Jun; Wang, Q.-W. (2014). "Beyond Parrondo's paradox". Scientific Reports. 4 (4244): 1–9. doi:10.1038/srep04244.
↑ G. P. Harmer and D. Abbott, "Losing strategies can win by Parrondo's paradox", Nature 402 (1999), 864
↑ D. Minor, "Parrondo's Paradox - Hope for Losers!", The College Mathematics Journal 34(1) (2003) 15-20
↑ G. P. Harmer and D. Abbott, "Parrondo's paradox", Statistical Science 14 (1999) 206-213
↑ G. P. Harmer, D. Abbott, P. G. Taylor, and J. M. R. Parrondo, in Proc. 2nd Int. Conf. Unsolved Problems of Noise and Fluctuations, D. Abbott, and L. B. Kish, eds., American Institute of Physics, 2000
↑ G. P. Harmer, D. Abbott, and P. G. Taylor, The Paradox of Parrondo's games, Proc. Royal Society of London A 456 (2000), 1-13
↑ G. P. Harmer, D. Abbott, P. G. Taylor, C. E. M. Pearce and J. M. R. Parrondo, Information entropy and Parrondo's discrete-time ratchet, in Proc. Stochastic and Chaotic Dynamics in the Lakes, Ambleside, U.K., P. V. E. McClintock, ed., American Institute of Physics, 2000
↑ Thomas K. Philips and Andrew B. Feldman, Parrondo's Paradox is not Paradoxical, Social Science Research Network (SSRN) Working Papers, August 2004
↑ V. A. A. Jansen and J. Yoshimura "Populations can persist in an environment consisting of sink habitats only". Proceedings of the National Academy of Sciences USA, 95(1998), 3696-3698 .
↑ R. Iyengar and R. Kohli, "Why Parrondo's paradox is irrelevant for utility theory, stock buying, and the emergence of life," Complexity, 9(1), pp. 23-27, 2004
↑ Winning While Losing: New Strategy Solves'Two-Envelope' Paradox at Physorg.com
↑ M. Stutzer, The Paradox of Diversification, The Journal of Investing, Vol. 19, No.1, 2010.
↑ M. Stutzer, "A Simple Parrondo Paradox", Mathematical Scientist, V.35, 2010.
↑ Wolf, Denise M.; Vazirani, Vijay V.; Arkin, Adam P. (2005-05-21). "Diversity in times of adversity: probabilistic strategies in microbial survival games". Journal of Theoretical Biology. 234 (2): 227–253. doi:10.1016/j.jtbi.2004.11.020.
↑ Cheong, Kang Hao; Tan, Zong Xuan; Xie, Neng-gang; Jones, Michael C. (2016-10-14). "A Paradoxical Evolutionary Mechanism in Stochastically Switching Environments". Scientific Reports. 6. doi:10.1038/srep34889. ISSN 2045-2322.

External links

Decision theory paradoxes

Abilene Apportionment Arrow's Buridan's ass Chainstore Condorcet's Decision-making Downs Ellsberg Fenno's Fredkin's Green Hedgehog's Inventor's Kavka's toxin puzzle Morton's fork Navigation Newcomb's Parrondo's Prevention Prisoner's dilemma Tolerance Willpower

List of paradoxes

Topics in game theory

Definitions	Normal-form game Extensive-form game Escalation of commitment Graphical game Cooperative game Succinct game Information set Hierarchy of beliefs Preference

Equilibrium concepts	Nash equilibrium Subgame perfection Mertens-stable equilibrium Bayesian Nash equilibrium Perfect Bayesian equilibrium Trembling hand Proper equilibrium Epsilon-equilibrium Correlated equilibrium Sequential equilibrium Quasi-perfect equilibrium Evolutionarily stable strategy Risk dominance Core Shapley value Pareto efficiency Gibbs equilibrium Quantal response equilibrium Self-confirming equilibrium Strong Nash equilibrium Markov perfect equilibrium

Strategies	Dominant strategies Pure strategy Mixed strategy Tit for tat Grim trigger Collusion Backward induction Forward induction Markov strategy

Classes of games	Symmetric game Perfect information Simultaneous game Sequential game Repeated game Signaling game Screening game Cheap talk Zero-sum game Mechanism design Bargaining problem Stochastic game n-player game Large Poisson game Nontransitive game Global games Strictly determined game Potential game

Games	Prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Rock-paper-scissors Pirate game Dictator game Public goods game Blotto games War of attrition El Farol Bar problem Fair division Fair cake-cutting Cournot game Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Prisoners and hats puzzle Trust game Princess and monster game Monty Hall problem Rendezvous problem

Theorems	Minimax theorem Nash's theorem Purification theorem Folk theorem Revelation principle Arrow's impossibility theorem

Key figures	Albert W. Tucker Amos Tversky Ariel Rubinstein Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin Jean Tirole Jean-François Mertens John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Thomas Schelling William Vickrey

See also	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition List of game theorists List of games in game theory No-win situation Topological game Tragedy of the commons Tyranny of small decisions

This article is issued from Wikipedia - version of the 11/20/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.