关于「注意力的拥堵:热门赛道、霍特林与数字布雷斯悖论」,《布雷斯悖论与无秩序代价》给出的定量结论是什么?

结论:霍特林的线性城市在价格固定时预测卖家扎堆,但在价格竞争下这个结论不成立:线性成本下靠得太近时没有价格均衡,平方成本下卖家会尽量远离,因为靠近对手只会引来价格战。在热门赛道的拥堵博弈中,均衡把过多的卖家挤进热门赛道,总收益比最优低约 4%;进入热门赛道给他人造成的损失是进入边缘赛道的两倍,按这一损失收费可以使均衡变成最优。「数字布雷斯悖论」只在注意力的流动经过两个相连的拥堵环节时才可能出现,是一个有待检验的类比。下一章讨论推荐系统怎样分配有限的曝光。

数据口径:书中关于流量池与推荐算法的模型都是示意,不描述任何真实平台;本书不是投资、经营或营销建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

fixed prices, two sellers: best replies end at 0.50 and 0.50
fixed prices, three sellers on an 11-point grid0 location equilibria
linear cost, sellers at a and 1 - a: undercutting profit (vs 0.50), equilibrium?
a0.00: 0.00 yes a = 0.10: 0.20 yes a = 0.20: 0.40 yes
a0.25: 0.50 yes a = 0.30: 0.60 no a = 0.40: 0.80 no
quadratic cost, sellers at a and 1 - a: a price profit formula (1 - 2a)/2
0.001.000 0.500 0.500
0.100.800 0.400 0.400
0.200.600 0.300 0.300
0.300.400 0.200 0.200
0.400.200 0.100 0.100
0.450.100 0.050 0.050
seller 2 at 0.70; seller 1's equilibrium profit by its location:
0.00.283, 0.1: 0.261, 0.2: 0.234, 0.3: 0.200, 0.4: 0.160, 0.5: 0.114, 0.6: 0.060
查看完整验算程序
# Hotelling's line and its correction. Consumers spread uniformly on [0, 1] buy one unit
# from the seller with the lowest price + travel cost. (1) Fixed, equal prices: sellers
# choose locations only. (2) Linear travel cost t|d| with price competition: Hotelling's
# candidate prices fail when sellers are close (d'Aspremont, Gabszewicz & Thisse 1979).
# (3) Quadratic travel cost t d^2: price equilibria exist for all locations, and sellers
# move APART. t = 1 throughout.
import itertools
G = [i / 20 for i in range(21)]                       # grid of locations

def shares_fixed(locs):          # equal prices: buyers go to the nearest seller
    pts = sorted(set(locs)); cut = [0] + [(u + v) / 2 for u, v in zip(pts, pts[1:])] + [1]
    turf = {x: cut[k + 1] - cut[k] for k, x in enumerate(pts)}
    return [turf[x] / locs.count(x) for x in locs]

a, b = 0.1, 0.9
for _ in range(20):                         # two sellers take turns to best-respond
    a = max(G, key=lambda x: (shares_fixed([x, b])[0], -abs(x - a)))
    b = max(G, key=lambda x: (shares_fixed([a, x])[1], -abs(x - b)))
print(f"fixed prices, two sellers: best replies end at {a:.2f} and {b:.2f}")
G3 = [i / 10 for i in range(11)]
ne = 0
for locs in itertools.combinations_with_replacement(G3, 3):
    s = shares_fixed(list(locs))
    dev = lambda i, x: shares_fixed(list(locs[:i]) + [x] + list(locs[i + 1:]))[i]
    if all(s[i] >= max(dev(i, x) for x in G3) - 1e-9 for i in range(3)):
        ne += 1
print(f"fixed prices, three sellers on an 11-point grid: {ne} location equilibria")

# Linear cost, sellers at a and 1 - a: Hotelling's prices are 1 each (profit 0.5);
# undercutting to the rival's price minus the travel cost between them, 1 - (1 - 2a),
# takes the whole market.
print("linear cost, sellers at a and 1 - a: undercutting profit (vs 0.50), equilibrium?")
for row in ((0.0, 0.1, 0.2), (0.25, 0.3, 0.4)):
    print("   " + "   ".join(f"a = {a:.2f}: {2 * a:.2f} {'yes' if 2 * a <= 0.5 else 'no'}"
                             for a in row))

def demand1(p1, p2, x1, x2):                          # quadratic cost, x1 < x2
    y = (p2 - p1 + x2 * x2 - x1 * x1) / (2 * (x2 - x1))
    return min(1.0, max(0.0, y))

def best_price(p_other, x1, x2, first=True):
    lo, hi = 0.0, 3.0
    f = (lambda p: p * demand1(p, p_other, x1, x2)) if first else \
        (lambda p: p * (1 - demand1(p_other, p, x1, x2)))
    for _ in range(100):                              # golden-section search
        m1, m2 = lo + (hi - lo) * 0.382, lo + (hi - lo) * 0.618
        if f(m1) < f(m2): lo = m1
        else: hi = m2
    return (lo + hi) / 2

def equilibrium(x1, x2):
    p1 = p2 = 0.5
    for _ in range(200):
        p1 = best_price(p2, x1, x2); p2 = best_price(p1, x1, x2, first=False)
    d = demand1(p1, p2, x1, x2)
    return p1, p2, p1 * d, p2 * (1 - d)

print("quadratic cost, sellers at a and 1 - a:   a   price  profit  formula (1 - 2a)/2")
for a in (0.0, 0.1, 0.2, 0.3, 0.4, 0.45):
    p1, _, f1, _ = equilibrium(a, 1 - a)
    print(f"{'':40s}{a:.2f}  {p1:.3f}  {f1:.3f}   {(1 - 2 * a) / 2:.3f}")
prof = [(x, equilibrium(x, 0.7)[2]) for x in (0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6)]
print("seller 2 at 0.70; seller 1's equilibrium profit by its location:")
print("   " + ", ".join(f"{x:.1f}: {f:.3f}" for x, f in prof))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《算法博弈论、布雷斯悖论与流量分配的无秩序代价》第 4 章「注意力的拥堵:热门赛道、霍特林与数字布雷斯悖论」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23782094

DOI: 10.5281/zenodo.23782094 · 阅读本章所在专著 · 5DL-B-032 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026032,
  author    = {Fan, Yafu},
  title     = {Algorithmic Game Theory, Braess's Paradox and the Price of Anarchy in Traffic and Attention Networks},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23782094},
  url       = {https://doi.org/10.5281/zenodo.23782094}
}

本书其他章节结论