What does Extra Entries, Extra Layers conclude, in numbers, about “Two Principles: Wardrop Equilibrium, and How a "One-Tap" Entry Makes Every Buyer Wait Four Minutes Longer”?

Answer: Wardrop's first principle describes the result of buyers choosing their routes for themselves, the second the result with the least average wait. Program p11 shows that a crowded fast lane is used, at the user equilibrium, until it is as slow as the standard checkout, an average of 10.000 minutes, whereas the optimal split needs only 7.500, a ratio of 1.3333. Program p12 shows that a zero-cost "one-tap" entry takes every buyer from 12 minutes to 16, and that nobody can get quicker by switching alone. The next chapter returns to Braess's original network and asks a sharper question: at what levels of demand does a new entry actually hurt?

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: 1.3333, 10.000, 7.500

share on fast lane, minutes on each entry, average minutes
share fast lane standard average
00.000 10.000 10.000
1/42.500 10.000 8.125
1/25.000 10.000 7.500
3/47.500 10.000 8.125
110.000 10.000 10.000
Wardrop 1 (each buyer for himself): share 1
110.000 10.000 10.000 <- user equilibrium
Wardrop 2 (least average wait): share 1/2
1/25.000 10.000 7.500 <- system optimum
ratio of averages4/3 = 1.3333
fast-lane users in the optimum wait 5, standard users 10
Show the full program
# Chapter 1. p11: two purchase entries in exact fractions - where buyers
# settle on their own (Wardrop's first principle) and where the average
# wait is least (his second principle).
# Model (illustrative, Pigou's two-road shape): one hundred buyers an
# hour (demand normalised to 1). The standard checkout always takes
# 10 minutes. The fast lane is a human order desk whose wait is
# 10 * s minutes when a share s of buyers uses it.
from fractions import Fraction as F

T_STD = F(10)
SLOPE = F(10)


def wait_fast(s):
    return SLOPE * s


def average(s):
    return s * wait_fast(s) + (1 - s) * T_STD


def show(s, tag=""):
    line = ("  %5s   %7.3f   %8.3f   %8.3f  %s"
            % (str(s), float(wait_fast(s)), float(T_STD),
               float(average(s)), tag))
    print(line.rstrip())


print("share on fast lane, minutes on each entry, average minutes")
print("  share   fast lane   standard   average")
for k in range(5):
    show(F(k, 4))
# Wardrop 1: every used entry has the same wait, none used is shorter.
# The fast lane is never slower than 10 until s = 1, so all take it.
s_ue = min(F(1), T_STD / SLOPE)
# Wardrop 2: minimise s * 10 s + (1 - s) * 10; derivative 20 s - 10 = 0
s_so = (T_STD / SLOPE) / 2
print()
print("Wardrop 1 (each buyer for himself): share %s" % s_ue)
show(s_ue, "<- user equilibrium")
print("Wardrop 2 (least average wait):     share %s" % s_so)
show(s_so, "<- system optimum")
poa = average(s_ue) / average(s_so)
print("ratio of averages = %s = %.4f" % (poa, float(poa)))
print("fast-lane users in the optimum wait %s, standard users %s"
      % (wait_fast(s_so), T_STD))

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 1: Two Principles: Wardrop Equilibrium, and How a "One-Tap" Entry Makes Every Buyer Wait Four Minutes Longer. 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