关于「逆向博弈论:激励相容与显示原理」,《机制设计与谈判博弈》给出的定量结论是什么?
结论:结果显示了这一机制的三个性质。第一,切的人如实地按自己的偏好切(切在 0.362 处),得到自己眼中恰好一半;挑的人得到自己眼中的 0.777,两人都不嫉妒对方。第二,它保证的只是一半,并不保证「公平地分享剩余」:如果切的人知道挑的人的偏好,她会把刀移到挑的人恰好无所谓的位置(0.638),自己拿到 0.777,挑的人只剩 0.501——仍然无嫉妒,但好处全归了切的人。这正是机制设计关心的信息问题:规则的结果取决于谁知道什么。第三,它不一定有效:两人估值之和最高可以达到 1.300(从正中间切开、各拿自己喜欢的一端),而「我切你选」只得到 1.277。
数据口径:本书不是法律意见;拍卖串通、围标等违法行为只作为机制弱点讨论,不提供操作方法。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.362, 0.501, 0.638, 0.777, 1.277, 1.300
honest cut at 0.362: cutter gets 0.500 (other piece 0.500 to her); chooser 0.777 informed cutter cuts at 0.638: she gets 0.777, chooser 0.501 sum of values: honest 1.277, informed 1.277, best split 1.300
查看完整验算程序
# "I cut, you choose" on a cake [0, 1]. Cutter's density f(x) = 1.6 - 1.2x (likes the left
# end); chooser's g(x) = 0.4 + 1.2x (likes the right end); each values the cake at 1.
f = lambda x: 1.6 - 1.2 * x
g = lambda x: 0.4 + 1.2 * x
def value(dens, a, b, steps=4000): # midpoint-rule integral
h = (b - a) / steps
return sum(dens(a + (k + 0.5) * h) for k in range(steps)) * h
def play(cut): # chooser takes the piece he prefers
takes_right = value(g, cut, 1) >= value(g, 0, cut)
cutter = value(f, 0, cut) if takes_right else value(f, cut, 1)
return cutter, max(value(g, 0, cut), value(g, cut, 1))
lo, hi = 0.0, 1.0 # honest cut: halves equal for HER
for _ in range(50):
mid = (lo + hi) / 2
lo, hi = (mid, hi) if value(f, 0, mid) < 0.5 else (lo, mid)
cg, hg = play(hi)
print(f"honest cut at {hi:.3f}: cutter gets {cg:.3f} (other piece {1 - cg:.3f} to her);"
f" chooser {hg:.3f}")
# An informed cutter moves the knife to the chooser's indifference point.
cuts = [k / 1000 for k in range(1, 1000)]
k = max((c for c in cuts if value(g, c, 1) >= value(g, 0, c)), key=lambda c: play(c)[0])
ci, hi2 = play(k)
print(f"informed cutter cuts at {k:.3f}: she gets {ci:.3f}, chooser {hi2:.3f}")
print(f"sum of values: honest {cg + hg:.3f}, informed {ci + hi2:.3f}, "
f"best split {value(f, 0, 0.5) + value(g, 0.5, 1):.3f}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《机制设计、激励相容与谈判博弈的数学模型》第 1 章「逆向博弈论:激励相容与显示原理」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23765012
DOI: 10.5281/zenodo.23765012 · 阅读本章所在专著 · 5DL-B-027 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026027,
author = {Fan, Yafu},
title = {Mechanism Design, Incentive Compatibility and the Game Theory of Negotiation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23765012},
url = {https://doi.org/10.5281/zenodo.23765012}
}