关于「三个价格与一个订阅」,《诊断收费站、悬念缺口与解锁定价》给出的定量结论是什么?

结论:第三章说明三个价格赚到单一价格的 4.9029 倍,中档只增加到 1.0065 倍,订阅再增加到 1.3575 倍。

数据口径:书中的用户、比率与参数均为示意模型;全部计算由书中程序生成;本书不是法律、财务或消费者保护方面的建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

menurevenue/visitorsingledeepfullenvelope
single1.59700.16130.00000.00006.1742
single + deep3.95660.04330.11800.000016.0529
single + full7.77920.09190.00000.069437.0451
single + deep + full7.83000.04330.06190.056137.0451
three prices over one: 4.9029
adding the deep tier to single + full: 1.0065
share of the envelope taken by three prices: 0.2114
查看完整验算程序
# Chapter 3. p05: Three prices on one paywall. A visitor at the paywall
# has an intensity w (lognormal, median USD 3, spread 1.2). The single
# unlock is worth w to her, the deeper unlock 2.6 w, the full case 6 w.
# Prices: USD 9.90, 29.90, 99. She takes the option with the largest
# positive surplus, or none. We compare menus, and the most a seller who
# knew each w could take (her value of the best option, the envelope).
# 200000 visitors, seed 114.
import math
import random

OPTS = {"single": (9.90, 1.0), "deep": (29.90, 2.6), "full": (99.0, 6.0)}

def run(menu, n=200000):
    rng = random.Random(114)
    rev, mix, env = [], {k: 0 for k in OPTS}, []
    for _ in range(n):
        w = math.exp(math.log(3.0) + 1.2 * rng.gauss(0, 1))
        best, pick = 0.0, None
        for k in menu:
            p, f = OPTS[k]
            if f * w - p > best:
                best, pick = f * w - p, k
        env.append(max(OPTS[k][1] * w for k in menu))
        if pick:
            rev.append(OPTS[pick][0])
            mix[pick] += 1
    return math.fsum(rev) / n, {k: v / n for k, v in mix.items()}, \
        math.fsum(env) / n

if __name__ == "__main__":
    print("menu                    revenue/visitor  single   deep    full"
          "   envelope")
    for menu in (("single",), ("single", "deep"), ("single", "full"),
                 ("single", "deep", "full")):
        r, mix, env = run(menu)
        print("{:22s}  {:15.4f}  {:6.4f}  {:6.4f}  {:6.4f}  {:8.4f}".format(
            " + ".join(menu), r, mix["single"], mix["deep"], mix["full"],
            env))
    r1 = run(("single",))[0]
    r3 = run(("single", "deep", "full"))[0]
    print("three prices over one: {:.4f}".format(r3 / r1))
    r2 = run(("single", "full"))[0]
    print("adding the deep tier to single + full: {:.4f}".format(r3 / r2))
    print("share of the envelope taken by three prices: {:.4f}".format(
        r3 / run(("single", "deep", "full"))[2]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《算法诊断收费站、悬念缺口校准与多阶解锁经济学》第 3 章「三个价格与一个订阅」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-114 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026114,
  author    = {Fan, Yafu},
  title     = {Algorithmic Diagnostic Paywalls, Curiosity-Gap Calibration and Tiered Report Unlock Economics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论