Paradox & Proof Entry #1119 Classified Declassified

Why two losing bets can win when you alternate them

Parrondo paradox shows why two losing bets can win when you alternate them: the switching itself changes the state distribution the games are played from.

No visual record attached The written record below is complete.
Two payoff tables, each losing on its own, produce a rising bankroll when the play alternates.

Intuition test — answer before you read on

Why can two losing games win when alternated?

Two games are each rigged against the player. Play either one alone and the bankroll drifts downward. Alternate between them on a fixed schedule and the bankroll drifts upward. This is not a trick of accounting; it is a property of the games’ state dependence. Parrondo paradox, described by Juan Parrondo and developed with Derek Abbott and Gregory Harmer around 1999 and 2000, shows that two individually losing processes can combine into a winning one when the switching rule changes the distribution of states the process occupies.

What everyone sees

What everyone sees is a contradiction. If each game has a negative expected value, any mixture of them should also be negative, because expectation is linear. The intuition is that losing plus losing must lose, and that alternating merely averages two bad options. The paradox looks like a violation of arithmetic, and the natural response is to assume the simulation is wrong or the games are not really losing. Nobody suspects that the expectation of each game is being computed at a state distribution that the other game changes.

What is actually happening

Parrondo’s original construction used a capital-dependent game and a history-dependent game, each with a losing expectation when played alone, whose alternation produced a winning expectation. Harmer and Abbott explained the result in Statistical Science in 1999, and Abbott described it for a general audience in Nature in 1999. Parrondo, Harmer, and Abbott later connected the effect to Brownian ratchets in Physical Review Letters in 2000, showing that the switching acts like a ratchet that rectifies a fluctuating process. The mechanism is state dependence: the two games have different payoffs in different states, and alternating moves the process into states where the favourable payoffs of each game are more likely. The expectation of each game, evaluated at the mixture’s state distribution, is not the average of the two expectations evaluated separately.

Why it stays hidden

It stays hidden because the linearity of expectation is true and misleading at the same time. Expectation is linear in the payoffs, but each game’s payoff depends on the state, and the state distribution is not fixed. Analysts who compute each game’s expectation at the same state distribution will correctly find both negative and correctly miss the effect. The paradox also hides because it is fragile: the switching schedule matters, and a different alternation rule can lose. It is a real property of state-dependent processes, not a general licence to combine bad options, and that boundary is exactly what gets lost when the result is retold as a curiosity.

How Parrondo paradox shows up outside games

The structure appears wherever a system has state-dependent payoffs and a control rule that shifts the state. Alternating between two mediocre strategies can outperform either one when each strategy is strong in a state the other creates.

Molecular motors and Brownian ratchets use the same principle: a fluctuating process with a state-dependent bias can produce directed motion without a net energy gradient, which is why Parrondo’s construction is studied in physics as well as in game theory.

The evidence in numbers and field studies

Harmer and Abbott’s 1999 paper in Statistical Science gave explicit payoff tables for two losing games whose alternation wins, and showed that the result depends on the switching pattern rather than on any hidden advantage in either game.

Parrondo, Harmer, and Abbott, writing in Physical Review Letters in 2000, generalised the construction and linked it to ratchet theory, and Abbott’s 1999 Nature note made the counterintuitive result widely known. Later work has applied the framework to population dynamics, portfolio switching, and control theory.

When the paradox does not apply

The paradox requires state dependence. If both games have payoffs that do not depend on the current state, alternating cannot help, because the expectation of a mixture of independent fixed-payoff games is the weighted average of their expectations.

It also requires the right switching rule. Random or badly timed alternation can destroy the effect, and in many real settings the state is not observable, which makes the ratchet impossible to operate deliberately. The lesson is not that losing strategies combine into winning ones, but that the state distribution is part of the game.

Two losing games can win together when the switching changes the states they are played from.

Questions readers ask

What is Parrondo paradox?

It is the result that two games, each with a negative expected value when played alone, can produce a positive expected value when alternated in a suitable pattern, because the switching changes the distribution of states the process occupies.

Does Parrondo paradox violate the linearity of expectation?

No. Expectation is linear in payoffs, but each game’s payoff depends on the state, and the state distribution changes when you switch games. Evaluating each game at the same state distribution misses the effect.

What are the two games in Parrondo paradox?

Parrondo’s original pair is a capital-dependent game, whose payoff depends on the current bankroll, and a history-dependent game, whose payoff depends on recent outcomes. Each loses alone; their alternation wins.

Is Parrondo paradox useful in practice?

It is studied in physics as a ratchet mechanism and applied in control theory and portfolio switching, but it requires observable state dependence and a suitable switching rule, so it is not a general licence to combine losing strategies.

Collect this card

Two losing games can win together when the switching changes the states they are played from.

0 / 10,000 collected

Sources & further reading 3
  1. Gregory P. Harmer and Derek Abbott, "Parrondo's Paradox," Statistical Science, 1999
  2. Derek Abbott, "Parrondo's Paradox: Losing Strategies Can Win by Combining Them," Nature, 1999
  3. Juan M. R. Parrondo, Gregory P. Harmer, and Derek Abbott, "New Paradoxical Games Based on Brownian Ratchets," Physical Review Letters, 2000

Circulate this file

Annotations are reserved for archive members.

Sign in to annotate