Braess's Paradox // 1968

How Selfish Routing
Makes Traffic Worse

In 1968, mathematician Dietrich Braess proved that adding a free road to a traffic network can make every driver's journey longer — not through bad luck, but through the inescapable logic of individual optimization in interconnected systems.

▼ scroll to begin
THE NETWORK
route split
— min travel time
network state

A Diamond of Roads

Meet the Braess network: four nodes — S (source), A, B, and T (destination) — connected by four roads.

Two roads are congestion-sensitive: their travel time grows with the number of drivers. Two roads are fixed-cost highways: always 45 minutes regardless of traffic.

Every day, 100 drivers must travel from S to T. They choose freely between the top path (S→A→T) and the bottom path (S→B→T).

Drivers Seek Equilibrium

Economist John Glen Wardrop observed in 1952 that rational commuters keep switching routes until no one can reduce their travel time by changing — a Nash equilibrium applied to traffic flow.

If the top route is faster, drivers migrate there until congestion equalizes travel times. If the bottom route is faster, the flow shifts back. The system self-organizes without any central planner.

This powerful idea became the foundation of all modern traffic theory. It seemed to imply that adding roads could only help.

The Efficient 50/50 Split

With 100 drivers, the Wardrop equilibrium settles at exactly 50 on each route:

Route 1 (top): t(S→A) = 50×45/100 + 45 = 67.5 min
Route 2 (bottom): 45 + t(B→T) = 45 + 22.5 = 67.5 min

Both routes are exactly equal. No driver can improve by switching. This is simultaneously the Nash equilibrium and the system optimum. Individual and collective interests align perfectly.

The City Builds a Free Road

City engineers, eager to reduce congestion, build a new connector from A directly to B. It costs almost nothing to traverse — effectively zero travel time.

From a traditional planning perspective, this seems like unambiguous good news. A new road only adds options. Nobody is forced to use it. The worst case is that nobody uses it and nothing changes.

The 50/50 equilibrium appears stable. Appears.

Every Driver Sees a Better Option

From the 50/50 equilibrium, a driver on Route 1 calculates: if I take S→A→B→T instead, my travel time is t(S→A) + 0 + t(B→T).

At the current split: 22.5 + 0 + 22.5 = 45 min — that's 22.5 minutes faster than 67.5. Every driver has the same calculation. Every driver has the same incentive.

The shortcut is a dominant strategy: it beats every alternative regardless of what others do. The 50/50 equilibrium begins to unravel immediately.

Everyone Loses

In the new Nash equilibrium, all 100 drivers take S→A→B→T. Both the S→A and B→T edges now carry the full load:

t(S→A) = 100×45/100 = 45 min
t(A→B) = 0 min
t(B→T) = 100×45/100 = 45 min
Total: 90 minutes

The free road increased every commute from 67.5 min to 90 min — a 33% increase. Adding zero-cost capacity made every driver worse off.

Remove the Road, Fix the Traffic

The corrective action seems absurd: demolish the road you just built. But it works.

Stuttgart, Germany, 1969. A new road increased downtown travel times. City engineers closed it — and traffic immediately improved. This was the first real-world confirmation of Braess's 1968 paper, published just one year prior.

Seoul, South Korea, 2003. The city demolished the Cheonggyecheon Expressway, a 6-lane elevated highway. Traffic in central Seoul measurably improved. The highway is now a restored stream and public park.

The Price of Anarchy

Koutsoupias and Papadimitriou (1999) formalized this tension as the price of anarchy: the ratio of selfish-routing cost to system-optimum cost.

In Braess's network: 90 ÷ 67.5 = 4/3 ≈ 1.33. Selfish routing is 33% worse than coordinated routing.

Roughgarden and Tardos (2002) proved this is the worst possible case for linear-latency networks. The price of anarchy never exceeds 4/3. Braess's toy example happens to achieve this exact theoretical bound.

The Universal Trap

Cohen and Horowitz (1991) found the same paradox in electrical circuits and spring-mass systems. Adding a wire can increase total impedance. Adding a spring can increase load.

Internet routing exhibits Braess-like collapses when new links attract greedy packet routing. Power grids can lose efficiency when new transmission lines create dominant routes. Basketball teams can improve by removing a ball-dominant star (Skinner, 2010).

The pattern is universal: in any network where selfish agents route through shared congested resources, adding zero-cost shortcuts can destroy the equilibria that were quietly keeping the system efficient.


"More capacity always helps."

This assumption is so deeply embedded in infrastructure planning that it rarely gets examined. Bigger highways, more lanes, wider interchanges — the logic is intuitive. Traffic is a resource problem: add more resource, reduce the problem.

Braess's Paradox does not say this intuition is always wrong. In most networks, most of the time, adding capacity does help. The paradox requires a specific topology: a shortcut that connects two congestion-sensitive segments and becomes a dominant strategy that everyone rationally exploits. When that structure is present, more becomes less.

The Paradox in Numbers

Travel times for 100 drivers under three scenarios: no shortcut (the original Nash equilibrium), with the shortcut under selfish routing (the Braess trap), and with the shortcut under coordinated routing (system optimum). Adding a free road and allowing selfish routing increases travel times by 33%.

// Braess network · n=100 drivers · variable edges t=n/100×45min · fixed edges t=45min //


The invisible hand reaches for the shortcut.

Adam Smith's invisible hand works when individual benefit and collective benefit align. The butcher and baker serve the common good through private self-interest because their actions are largely independent — the baker's gain doesn't slow the butcher's customers.

Traffic networks are different. Every driver on a congested road imposes a cost on every other driver. Individual optimization in this setting can systematically degrade collective outcomes. The invisible hand reaches for the shortcut — and everyone slows down.

The fix is not to suppress rationality but to redesign the incentives that rationality faces. Congestion pricing, coordinated routing, or careful network design can realign individual and collective interest. But it requires acknowledging that the free market for road access is not, in the economically productive sense, free.

The Selfish Routing Trap

As drivers migrate from the 50/50 equilibrium toward the S→A→B→T shortcut, individual travel time initially appears to drop — then climbs steeply as both congestion-sensitive edges fill. The shortcut is a trap: it looks better at every intermediate state, until everyone has taken it and the outcome is worse for all.

// travel time as fraction of drivers on shortcut route increases from 0% → 100% //


Destroying what you built to save what matters.

The political economy of the Braess fix is brutal. You must convince a city council that the road they funded, built, and cut a ribbon for should be demolished. You must explain that visible, tangible infrastructure makes invisible, intangible harm — and do it armed only with mathematics and a few traffic studies from cities they've never visited.

Seoul did it. The Cheonggyecheon Expressway is gone. In its place: a restored stream, walking paths, and measurably better traffic. London priced its central city. Congestion fell 30% in the first year. Each of these required overcoming the intuition that Braess's 1968 paper — quietly, in German, in an obscure operations research journal — had the mathematics to challenge.

// Build Your Own Network

Explore the Braess network interactively. Adjust the number of drivers, toggle the shortcut road, and switch between selfish routing (Nash equilibrium) and coordinated routing (system optimum). The price of anarchy updates in real time.

Route 1 (top) 50 cars
Route 2 (bottom) 50 cars
Shortcut (A→B) no road
Avg. Travel Time 67.5 min
System Optimum 67.5 min
Price of Anarchy 1.00×