关于「实证闭环:限量预售成团页的操作流程、计算器与预注册检验」,《保证合约与预售成团》给出的定量结论是什么?

结论:第八章给出限量预售成团页的操作流程、蒸馏小工具「成团门槛概率计算器」与预注册检验方案,整场设计每组需要 392 场预售。书中含 20 段可运行的 Python 程序。

数据口径:书中参数为示意;全部计算由书中程序生成。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 392

z for 0.9751.9600, z for 0.80 = 0.8416
visitors per arm (0.040 vs 0.046)17943
pre-sales per arm (0.45 vs 0.55)392
simulated power 0.8050, false alarms 0.0390 (2000 runs)
查看完整验算程序
# Chapter 8. p82: sample size for the pre-registered test. Both arms
# keep the full refund; arm B adds a refund bonus. Unit 1: visitors,
# outcome = pledges (illustrative 0.040 versus 0.046). Unit 2: whole
# pre-sales, outcome = batch made (illustrative 0.45 versus 0.55).
# Two-sided alpha 0.05, power 0.80, normal approximation for two
# proportions; then a fixed-seed simulation of the campaign-level
# design checks power and the false-alarm rate at the computed size.
import math
import random


def phi(z):
    return 0.5 * (1 + math.erf(z / math.sqrt(2)))


def zq(p):
    lo, hi = -10.0, 10.0
    for _ in range(100):
        mid = (lo + hi) / 2
        if phi(mid) < p:
            lo = mid
        else:
            hi = mid
    return (lo + hi) / 2


def n_per_arm(p1, p2, alpha=0.05, power=0.80):
    za, zb = zq(1 - alpha / 2), zq(power)
    pb = (p1 + p2) / 2
    num = (za * math.sqrt(2 * pb * (1 - pb))
           + zb * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2)))
    return math.ceil(num ** 2 / (p1 - p2) ** 2)


def reject(rng, n, p1, p2, za):
    x1 = len([1 for _ in range(n) if rng.random() < p1])
    x2 = len([1 for _ in range(n) if rng.random() < p2])
    pb = (x1 + x2) / (2 * n)
    se = math.sqrt(2 * pb * (1 - pb) / n)
    return se > 0 and abs(x2 / n - x1 / n) / se > za


if __name__ == "__main__":
    print("z for 0.975 = {:.4f}, z for 0.80 = {:.4f}".format(
        zq(0.975), zq(0.80)))
    nv = n_per_arm(0.040, 0.046)
    nc = n_per_arm(0.45, 0.55)
    print("visitors per arm (0.040 vs 0.046): {}".format(nv))
    print("pre-sales per arm (0.45 vs 0.55): {}".format(nc))
    rng = random.Random(20261113)
    za, sims = zq(0.975), 2000
    hit = len([1 for _ in range(sims) if reject(rng, nc, 0.45, 0.55, za)])
    null = len([1 for _ in range(sims) if reject(rng, nc, 0.50, 0.50, za)])
    print("simulated power {:.4f}, false alarms {:.4f} ({} runs)".format(
        hit / sims, null / sims, sims))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《保证合约预售成团阈值、退款承诺与公共品搭便车均衡母典》第 8 章「实证闭环:限量预售成团页的操作流程、计算器与预注册检验」(版本 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}
}

本书其他章节结论