关于「折扣钩子与被高估的挽回」,《弃单、续费与大单筛选》给出的定量结论是什么?

结论:第二章发现折扣钩子会教会回头客故意弃单(学习概率 0.6 时一年收入 RM 880,971,低于普通提醒的 RM 882,196),而归因挽回中只有 0.43 是增量。

数据口径:书中的回访率、退订率、续费参数、客户估值与成交率均为示意或合成模型;全部数据由书中程序生成;本书不是法律意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

   plain reminders: RM 882,196 per year
   coupon, learning 0.0: RM 903,795 per year; 0 learners
     month 1 RM 75,440, month 12 RM 75,921
   coupon, learning 0.3: RM 892,270 per year; 250 learners
     month 1 RM 75,440, month 12 RM 73,402
   coupon, learning 0.6: RM 880,971 per year; 427 learners
     month 1 RM 75,440, month 12 RM 73,235
查看完整验算程序
# Chapter 2. p03: Discount hooks teach buyers to abandon on purpose.
# A cohort of 1,000 repeat buyers makes 12 purchase decisions a year at
# RM 98. Each decision: a "learner" abandons on purpose and waits for the
# coupon; a non-learner buys at once with probability p, otherwise
# abandons and is recovered by the coupon email with probability r.
# Each coupon received turns a non-learner into a learner with
# probability L. Learners recovered by coupon pay (1 - d) x price.
# Compare revenue per year with coupon emails (d = 10%) and with plain
# reminders (d = 0, no learning, lower recovery r0).
import random

N, ROUNDS, PRICE = 1000, 12, 98.0
P_BUY, R_COUPON, R_PLAIN, D = 0.70, 0.25, 0.17, 0.10

def run(coupon, learn, seed=79):
    rng = random.Random(seed)
    learner = [False] * N
    by_round = []
    for _ in range(ROUNDS):
        rev = 0.0
        for i in range(N):
            if rng.random() < P_BUY:
                if not learner[i]:
                    rev += PRICE
                elif rng.random() < 0.95:
                    rev += PRICE * (1 - D)
                continue
            r = R_COUPON if coupon else R_PLAIN
            if rng.random() < r:
                rev += PRICE * ((1 - D) if coupon else 1.0)
                if coupon and rng.random() < learn:
                    learner[i] = True
        by_round.append(rev)
    return by_round, sum(learner)

if __name__ == "__main__":
    plain, _ = run(False, 0.0)
    print("   plain reminders: RM {:,.0f} per year".format(sum(plain)))
    for learn in (0.0, 0.3, 0.6):
        rows, n = run(True, learn)
        print("   coupon, learning {:.1f}: RM {:,.0f} per year;"
              " {} learners".format(learn, sum(rows), n))
        print("     month 1 RM {:,.0f}, month 12 RM {:,.0f}".format(
            rows[0], rows[-1]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制》第 2 章「折扣钩子与被高估的挽回」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090209

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

BibTeX
@book{fan2026079,
  author    = {Fan, Yafu},
  title     = {Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090209},
  url       = {https://doi.org/10.5281/zenodo.24090209}
}

本书其他章节结论