What does Extra Entries, Extra Layers conclude, in numbers, about “The Main Argument: the Demand Window of Braess's Paradox and the Limits of the Four-Thirds Ceiling”?
Answer: Chapter 2 recomputes Braess's original network, finds the paradox's demand window from 2.581 to 8.889, and shows that fourth-power queue costs push the ceiling on losses to 2.1505.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 2.581, 8.889
| Braess network: equilibrium travel time per driver | ||||
| demand | no link | with link | on new route | change |
| 1.000 | 55.500 | 31.000 | 1.000 | -24.500 |
| 2.000 | 61.000 | 52.000 | 2.000 | -9.000 |
| 2.581 | 64.194 | 64.194 | 2.581 | +0.000 |
| 3.000 | 66.500 | 73.000 | 3.000 | +6.500 |
| 3.636 | 70.000 | 86.364 | 3.636 | +16.364 |
| 5.000 | 77.500 | 89.615 | 2.692 | +12.115 |
| 6.000 | 83.000 | 92.000 | 2.000 | +9.000 |
| 7.000 | 88.500 | 94.385 | 1.308 | +5.885 |
| 8.000 | 94.000 | 96.769 | 0.615 | +2.769 |
| 8.889 | 98.889 | 98.889 | 0.000 | +0.000 |
| 10.000 | 105.000 | 105.000 | 0.000 | +0.000 |
| paradox window: 80/31 < d < 80/9, i.e. 2.581 to 8.889 | ||||
| worst ratio at d = 40/11: 95/77 = 1.2338 (bound 4/3 = 1.3333) | ||||
| Braess's case d = 6: 83 -> 92 time units |
Show the full program
# Chapter 2. p21: Braess's own 1968 network, solved exactly in fractions
# for every demand level - the paradox lives only inside a window.
# Links (Braess 1968; English translation 2005): s-v costs 10x, v-t costs
# 50 + x, s-w costs 50 + x, w-t costs 10x, the added link v-w 10 + x,
# where x is the flow on the link. Demand d is the flow from s to t.
from fractions import Fraction as F
def without_link(d):
return 50 + F(11, 2) * d # half the flow on each side
def with_link(d):
# g = flow on s-v-w-t, f = flow on each outer route (symmetric)
if d <= F(40, 11):
return 10 + 21 * d, d # everybody on the new route
g = (40 - F(9, 2) * d) / F(13, 2)
if g <= 0:
return without_link(d), F(0)
f = (d - g) / 2
return 10 * (f + g) + 50 + f, g
print("Braess network: equilibrium travel time per driver")
print(" demand no link with link on new route change")
grid = [F(1), F(2), F(80, 31), F(3), F(40, 11), F(5), F(6), F(7),
F(8), F(80, 9), F(10)]
for d in grid:
a = without_link(d)
b, g = with_link(d)
print(" %6.3f %7.3f %9.3f %10.3f %+7.3f"
% (float(d), float(a), float(b), float(g), float(b - a)))
lo, hi = F(80, 31), F(80, 9)
print()
print("paradox window: %s < d < %s, i.e. %.3f to %.3f"
% (lo, hi, float(lo), float(hi)))
worst = F(40, 11)
r = with_link(worst)[0] / without_link(worst)
print("worst ratio at d = %s: %s = %.4f (bound 4/3 = %.4f)"
% (worst, r, float(r), 4 / 3))
d6 = F(6)
print("Braess's case d = 6: %s -> %s time units"
% (without_link(d6), with_link(d6)[0]))Single source and citation
Fan, Y. (2026). Braess's Paradox and Wardrop Equilibrium: When One More Purchase Entry or One More Coordination Layer Slows Everyone Down (Version 1.0.0), Chapter 2: The Main Argument: the Demand Window of Braess's Paradox and the Limits of the Four-Thirds Ceiling. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-246 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026246,
author = {Fan, Yafu},
title = {Braess's Paradox and Wardrop Equilibrium: When One More Purchase Entry or One More Coordination Layer Slows Everyone Down},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Two Principles: Wardrop Equilibrium, and How a "One-Tap" Entry Makes Every Buyer Wait Four Minutes Longer
- Chapter 3 · Frank and Wolfe in the Standard Library: Equilibrium, Optimum and the Relative Gap
- Chapter 4 · Purchase Entries: a Funnel Network, Elastic Orders and an Audit that Closes Entries One at a Time
- Chapter 5 · Coordination Layers: the More Efficient a Pure Relay, the Slower Every Request
- Chapter 6 · The Opposing Evidence: How Common the Paradox Is, How Much Buyers Know, and How Many New Customers a New Entry Brings
- Chapter 7 · Classical Sources East and West: "The Great Road Is Very Smooth, yet People Love the Byways" and Pigou's Two Roads
- Chapter 8 · Closing the Loop: Whole-Block Switchback Tests for Entries, an Audit of Organisational Layers, and a Pre-Registered Protocol