关于「主轴:布雷斯悖论的需求窗口与三分之四上界的边界」,《入口加法与协同层的均衡代价》给出的定量结论是什么?
结论:第二章复算布雷斯的原始网络,求出悖论的需求窗口 2.581 到 8.889,并显示四次方排队成本把损失上界推到 2.1505。
数据口径:书中参数为示意;全部计算由书中程序生成;本书是非个人化经营建议,任何删入口、撤协同层的生产变更须由主事者人工复核放行。 书中以标注框区分已发表的证据、可运行的 Python 计算(21 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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 |
查看完整验算程序
# 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]))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《布雷斯悖论瓦德罗普均衡、购买入口加法反效与协同层级的无秩序代价母典》第 2 章「主轴:布雷斯悖论的需求窗口与三分之四上界的边界」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}