关于「东西方原典考辨:「货恶其弃于地」与休谟的草地」,《保证合约与预售成团》给出的定量结论是什么?
结论:第七章考辨《礼记·礼运》「货恶其弃于地也,不必藏于己」与休谟的草地排水一例:在人人须参加且每人有百分之一疏忽时,一千人行动成功的概率只有 0.000043。
数据口径:书中参数为示意;全部计算由书中程序生成。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.000043
| (a) everyone needed, slip chance 0.01 | |
| N | 2 P(drained) = 0.980100 |
| N | 10 P(drained) = 0.904382 |
| N | 100 P(drained) = 0.366032 |
| N | 1000 P(drained) = 0.000043 |
| (b) half needed, C/V | 0.3: best mixed equilibrium |
| N K keep p keep P refund p refund P | |
| 2 | 1 0.7000 0.9100 0.7000 0.9100 |
| 10 | 5 - - 0.5196 0.6704 |
| 100 | 50 - - 0.4300 0.0951 |
| 1000 | 500 - - 0.4140 0.0000 |
查看完整验算程序
# Chapter 7. p71: Hume's meadow (Treatise 3.2.7.8) as a threshold
# game. N neighbours; the meadow is drained iff at least K of them
# work (cost C, value V to all, C / V = 0.3, illustrative).
# (a) K = N, everyone needed. Under refund (no work wasted if the
# plan fails) working is weakly dominant, but if each neighbour
# slips with chance 0.01 the plan succeeds only with 0.99 ** N.
# (b) K = N / 2. Symmetric mixed equilibria as in p12 and p13: the
# best batch chance under keep and under refund.
import math
R, SLIP = 0.3, 0.01
def lpmf(n, k, p):
return (math.lgamma(n + 1) - math.lgamma(k + 1)
- math.lgamma(n - k + 1) + k * math.log(p)
+ (n - k) * math.log(1 - p))
def tail(n, k, p):
return math.fsum(math.exp(lpmf(n, j, p)) for j in range(k, n + 1))
def gap(p, n, k, rule):
a = math.exp(lpmf(n - 1, k - 1, p))
return a - (R if rule == "keep" else R * tail(n - 1, k - 1, p))
def best(n, k, rule, steps=400):
xs = [i / steps for i in range(1, steps)]
top = None
for a, b in zip(xs, xs[1:]):
if gap(a, n, k, rule) * gap(b, n, k, rule) < 0:
lo, hi = a, b
for _ in range(50):
mid = (lo + hi) / 2
if gap(lo, n, k, rule) * gap(mid, n, k, rule) <= 0:
hi = mid
else:
lo = mid
top = (lo + hi) / 2
return top
if __name__ == "__main__":
print("(a) everyone needed, slip chance {}".format(SLIP))
for n in (2, 10, 100, 1000):
print(" N = {:4d} P(drained) = {:.6f}".format(
n, (1 - SLIP) ** n))
print("(b) half needed, C/V = {}: best mixed equilibrium".format(R))
print(" N K keep p keep P refund p refund P")
for n in (2, 10, 100, 1000):
k = max(1, n // 2)
row = []
for rule in ("keep", "refund"):
p = best(n, k, rule)
row.append(" - - " if p is None else
"{:7.4f} {:8.4f}".format(p, tail(n, k, p)))
print("{:6d} {:5d} {} {}".format(n, k, row[0], row[1]))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《保证合约预售成团阈值、退款承诺与公共品搭便车均衡母典》第 7 章「东西方原典考辨:「货恶其弃于地」与休谟的草地」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-316 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026316,
author = {Fan, Yafu},
title = {Assurance Contracts and Pre-Sale Group Thresholds: Refund Promises and Free-Riding Equilibria in Public Goods},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}