关于「在投放中学习:汤普森抽样与 CAC 的尾部」,《分销幂律、网红组合与分佣边界》给出的定量结论是什么?

结论:第四章比较在投放中学习的规则,并指出 CAC 的三种算法(723、500、304 令吉)中只有合并 CAC 对应盈亏。

数据口径:书中的分销员人数、销售分布、转化率、获客量、佣金比例与招募速度均为示意或合成模型;全部数据由书中程序生成;本书不是法律、财务或投资意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

measuremedian5% to 95% of years
share with no customer0.0730.049 to 0.094
mean per-campaign CAC (RM)723663 to 789
median per-campaign CAC (RM)500417 to 500
pooled CAC (RM)304271 to 341
campaigns giving half of sales0.1540.130 to 0.174
查看完整验算程序
# Chapter 4. p08: Which CAC to report. Each micro campaign spends
# RM 2,500 and wins a Poisson number of customers whose mean is
# lognormal (median 5, log sd 1.0). Over a year of 32 campaigns a month
# (384 campaigns), compare the share of campaigns with no customer at
# all, the mean and the median of per-campaign CAC (over campaigns with
# at least one customer), and the pooled CAC = total spend / total
# customers, and the share of campaigns that bring in half of all
# customers. 1,000 simulated years, seed 87.
import random
from math import exp

def poisson(rng, lam):
    k, t, u = 0, exp(-lam), rng.random()
    c = t
    while u > c and k < 1000:
        k += 1
        t *= lam / k
        c += t
    return k

def year(rng):
    wins = [poisson(rng, 5.0 * exp(rng.gauss(0, 1.0))) for _ in range(384)]
    cac = sorted(2500.0 / w for w in wins if w)
    zero = 1 - len(cac) / 384
    pooled = 2500.0 * 384 / sum(wins)
    acc, half = 0, 0
    for w in sorted(wins, reverse=True):
        acc += w
        half += 1
        if acc >= sum(wins) / 2:
            break
    return zero, sum(cac) / len(cac), cac[len(cac) // 2], pooled, half / 384

if __name__ == "__main__":
    rng = random.Random(87)
    ys = [year(rng) for _ in range(1000)]
    names = ("share with no customer", "mean per-campaign CAC (RM)",
             "median per-campaign CAC (RM)", "pooled CAC (RM)",
             "campaigns giving half of sales")
    print("   measure                          median   5% to 95% of years")
    for j, name in enumerate(names):
        v = sorted(y[j] for y in ys)
        fmt = "{:.3f}" if j in (0, 4) else "{:,.0f}"
        print("   {:<31}  {:>7}   {} to {}".format(
            name, fmt.format(v[500]), fmt.format(v[50]), fmt.format(v[949])))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《分销网络幂律激活、网红矩阵组合优化与激励稳定边界》第 4 章「在投放中学习:汤普森抽样与 CAC 的尾部」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090229

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

BibTeX
@book{fan2026087,
  author    = {Fan, Yafu},
  title     = {Affiliate Network Power Laws, Influencer Portfolio Optimization and Incentive Stability Bounds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090229},
  url       = {https://doi.org/10.5281/zenodo.24090229}
}

本书其他章节结论