关于「捆绑、诱饵档与按题付费」,《裂变、好奇心与付费墙》给出的定量结论是什么?

结论:第六章说明捆绑独立的问题在 20 题时收走 0.678 的价值,诱饵档的效果取决于一个必须测量的参数,按题付费与年卡并行最好。

数据口径:本书不是经营、法律或投资建议;全部数据为程序生成的合成数据。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

   questions   separate (per q)   bundle (per q)   value per q   share
       1           1.003              1.003           2.770        0.362
       2           1.000              1.187           2.753        0.431
       5           1.001              1.463           2.749        0.532
      10           0.999              1.670           2.758        0.605
      20           0.998              1.861           2.746        0.678
Reading: priced one by one, each question earns the same share
of its value however many there are. As one bundle, the share
captured climbs towards the whole value as n grows. This is an
argument for bundles of independent questions, not for tiers of
one reading.
查看完整验算程序
# Chapter 6. Why "ask as many questions as you like" can pay.
# A buyer's value for each answered question is independent across
# questions: log-normal with median 2 and log-sd 0.8. Selling n questions
# separately at the best single price per question, against selling the
# n as one bundle at the best bundle price (Bakos and Brynjolfsson: the
# law of large numbers makes the bundle's value per question concentrate
# near its mean, so one price captures more of it). 20,000 buyers.
import math
import random

def best_price(vals):
    vs = sorted(vals, reverse=True)
    return max(v * (i + 1) for i, v in enumerate(vs)) / len(vs)

if __name__ == "__main__":
    rng = random.Random(63011)
    print("   questions   separate (per q)   bundle (per q)   value per q"
          "   share")
    for n in (1, 2, 5, 10, 20):
        vals = [[2 * math.exp(rng.gauss(0, 0.8)) for _ in range(n)]
                for _ in range(20000)]
        sep = best_price([v for row in vals for v in row])
        bun = best_price([sum(row) for row in vals]) / n
        mean = sum(sum(row) for row in vals) / (20000 * n)
        print("     {:3d}          {:6.3f}             {:6.3f}"
              "          {:6.3f}        {:5.3f}".format(
                  n, sep, bun, mean, bun / mean))
    print("\nReading: priced one by one, each question earns the same share")
    print("of its value however many there are. As one bundle, the share")
    print("captured climbs towards the whole value as n grows. This is an")
    print("argument for bundles of independent questions, not for tiers of")
    print("one reading.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《超临界病毒级联、信息缺口风险率与多层付费墙优化》第 6 章「捆绑、诱饵档与按题付费」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090174

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

BibTeX
@book{fan2026063,
  author    = {Fan, Yafu},
  title     = {Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090174},
  url       = {https://doi.org/10.5281/zenodo.24090174}
}

本书其他章节结论