关于「显示原理、激励相容与承诺」,《VCG 拍卖与社群激励》给出的定量结论是什么?

结论:显示原理说:任何机制的均衡结果,都可以由一个让人如实报告的直接机制得到;占优策略版本与贝叶斯版本的证明都是把均衡策略「装进」机器。它让机制设计可以只研究激励相容的直接机制,但它不保证均衡唯一,依赖设计者的承诺能力,要求报告全部类型,也不保证参与者看得出占优策略。程序显示,由一价拍卖组合成的直接机制只是贝叶斯激励相容;不能承诺不降价的卖家,在多期、低等待成本时只能得到承诺收入的一小部分(\(d = 0.99\)、1,000 期时为 18.2%)。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的模型和假说;书中所有数据都是虚构或模拟的。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.99, 1000, 18.2

(A) Bayesian IC: largest gap, best report vs true value0.000
ex post, value 0.8, rival report 0.3: truth earns 0.400; report 0.301 earns 0.650
(B) two periods, d0.9: grid cutoff 0.846; closed form (2-d)/(4-3d) = 0.8462
revenue without commitment (commitment0.2500 for every d and T)
periods T1 2 5 20 100 1000
d0.5 0.2500 0.2250 0.2084 0.2071 0.2071 0.2071
d0.9 0.2500 0.2327 0.1926 0.1269 0.1201 0.1201
d0.99 0.2500 0.2476 0.2405 0.2084 0.1028 0.0455
d0.99, T = 1000: first price 0.0909, revenue 18.2% of the commitment value

核心公式

\[u_i\big(g(\sigma_i^*(\theta_i), \sigma_{-i}^*(\hat\theta_{-i}));\theta_i\big) \;\ge\; u_i\big(g(\sigma_i^*(\hat\theta_i), \sigma_{-i}^*(\hat\theta_{-i}));\theta_i\big),\]
查看完整验算程序
# Chapter 1. (A) The Bayesian revelation principle, checked on a grid: take the
# first-price auction with two bidders, values i.i.d. U[0,1], whose Bayes-Nash
# equilibrium is b(v) = v/2 (Book 27). The "direct" mechanism composes the strategy with
# the auction: report r, highest report wins and pays r/2. Truth is optimal in
# expectation (Bayesian IC) but NOT a dominant strategy: against a known rival report,
# shading pays. (B) Commitment: one buyer, v ~ U[0,1], T selling periods, discount d.
# With commitment the seller posts p = 1/2 once (revenue 1/4, Myerson / Riley-Zeckhauser).
# Without commitment she re-prices after each refusal and the buyer anticipates it (the
# Coase problem). Backward induction: with remaining types [0, k], continuation revenue
# is c_t k^2 and the price a_t k; type kappa is indifferent between buying now and next
# period: kappa - p = d (kappa - a_{t+1} kappa).
G = [i / 1000 for i in range(1001)]

def bayes_utility(v, r):              # P(win) = P(rival value < r) = r; pay r/2 if win
    return r * (v - r / 2)

def expost_utility(v, r, rival_report):
    return (v - r / 2) if r > rival_report else 0.0

def no_commitment(d, T):
    a, c = 0.5, 0.25                  # last period: price k/2, revenue k^2/4
    for _ in range(T - 1):
        m = 1 - d + d * a             # p = m * kappa keeps type kappa indifferent
        s = m / (2 * m - 2 * d * c)   # optimal new cutoff kappa = s k
        a, c = m * s, m * s * (1 - s) + d * c * s * s
    return c, a                       # revenue from k = 1, first-period price

if __name__ == "__main__":
    worst = max(abs(max(G, key=lambda r: bayes_utility(v, r)) - v) for v in G[::10])
    print(f"(A) Bayesian IC: largest gap, best report vs true value = {worst:.3f}")
    v, rival = 0.80, 0.30
    best = max(G, key=lambda r: expost_utility(v, r, rival))
    print(f"    ex post, value {v}, rival report {rival}: truth earns"
          f" {expost_utility(v, v, rival):.3f}; report {best:.3f} earns"
          f" {expost_utility(v, best, rival):.3f}")
    k2 = max(G, key=lambda k: k * (1 - 0.9 / 2) * (1 - k) + 0.9 * (k / 2) ** 2)
    print(f"(B) two periods, d = 0.9: grid cutoff {k2:.3f}; closed form (2-d)/(4-3d)"
          f" = {(2 - 0.9) / (4 - 3 * 0.9):.4f}")
    print("    revenue without commitment (commitment: 0.2500 for every d and T)")
    print("    periods T:      1       2       5      20     100    1000")
    for d in (0.5, 0.9, 0.99):
        row = [no_commitment(d, T) for T in (1, 2, 5, 20, 100, 1000)]
        print(f"    d = {d:<5}" + "".join(f"{c:8.4f}" for c, _ in row))
    c, a = no_commitment(0.99, 1000)
    print(f"    d = 0.99, T = 1000: first price {a:.4f}, revenue {c / 0.25:.1%}"
          " of the commitment value")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《机制设计、维克里—克拉克—格罗夫斯(VCG)拍卖与数字社群激励相容工程》第 1 章「显示原理、激励相容与承诺」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23836274

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

BibTeX
@book{fan2026050,
  author    = {Fan, Yafu},
  title     = {Mechanism Design, Vickrey–Clarke–Groves Auctions and Incentive-Compatible Community Engineering},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23836274},
  url       = {https://doi.org/10.5281/zenodo.23836274}
}

本书其他章节结论