关于「拍卖:维克里、收益等价与 VCG 的孤独」,《机制设计与谈判博弈》给出的定量结论是什么?

结论:二价拍卖让赢家支付第二高出价,使自己的出价只决定是否获胜、不决定价格,因此报真值是弱占优策略;程序在一百多万种组合上验证了这一点。但实验中的被试仍常常高报。一价拍卖中,压价是可以推导的均衡策略:在 \(n\) 人均匀独立私人价值的模型中,\(b(v) = (n-1)v/n\);实验中的出价常高于这一风险中性基准。收益等价定理说明一价、二价与全付拍卖的期望收入相同,但收入的风险不同。VCG 机制在理论上实现如实报告与有效配置,在实践中却可能收入很低、随竞争者增加反而下降,并且对落败者的协调与虚假身份很脆弱。下一章讨论,当买卖双方都有私人信息时,事情会难到什么程度。

数据口径:本书不是法律意见;拍卖串通、围标等违法行为只作为机制弱点讨论,不提供操作方法。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

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

1,030,301 (value, bid, rival) cases; truthful bid worse0 times
untruthful (value, bid) pairs that lose strictly to some rival bid10,100
v0.60; payoff when the best rival bid is 0.30 / 0.50 / 0.70 / 0.90:
bid 0.40: +0.30 +0.00 +0.00 +0.00
bid 0.60: +0.30 +0.10 +0.00 +0.00
bid 0.80: +0.30 +0.10-0.10 +0.00

核心公式

\[U(b) = (v - b)\left(\frac{b}{\beta}\right)^{n-1}.\]
查看完整验算程序
# Second-price auction: highest bid wins, pays the best rival bid r (ties split).
# Check on a grid: bidding one's value v is never worse than any other bid b, for any r.
GRID = [round(k * 0.01, 2) for k in range(101)]

def payoff(v, b, r):
    return v - r if b > r else (v - r) / 2 if b == r else 0.0

worse, strict = 0, 0
for v in GRID:
    for b in GRID:
        d = [payoff(v, v, r) - payoff(v, b, r) for r in GRID]
        worse += sum(x < -1e-12 for x in d)
        strict += b != v and any(x > 1e-12 for x in d)
print(f"{len(GRID) ** 3:,} (value, bid, rival) cases; truthful bid worse: {worse} times")
print(f"untruthful (value, bid) pairs that lose strictly to some rival bid: {strict:,}")
print("v = 0.60; payoff when the best rival bid is 0.30 / 0.50 / 0.70 / 0.90:")
for b in (0.40, 0.60, 0.80):
    row = "  ".join(f"{payoff(0.6, b, r):+.2f}" for r in (.3, .5, .7, .9))
    print(f"  bid {b:.2f}: {row}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《机制设计、激励相容与谈判博弈的数学模型》第 2 章「拍卖:维克里、收益等价与 VCG 的孤独」(版本 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}
}

本书其他章节结论