5D Library › Books › 5DL-B-079

弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制

多脉冲追销时序、转换成本累积与甄别博弈均衡

Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms: Multi-Pulse Follow-Up Timing, Switching-Cost Accumulation and Screening Equilibria

  • 范雅福 Fan Yafu
  • Version 1.0.0 · 2026-11-08
  • CC-BY-NC-ND-4.0
  • 5DL-B-079
DOI10.5281/zenodo.24090209

摘要

买家放弃购物车之后何时跟进、发几次?订阅者积累的数据会不会让续费逐月上升?一笔 RM 9,800 或 RM 29,800 的企业牌照,怎样用菜单、申请表与订金筛选客户?本书把这些经验法则写成可以运行的算术,再看它们在什么条件下成立。书中的回访率、退订率、续费参数、客户估值与成交率均为示意或合成模型;全部数据由书中程序生成;本书不是法律意见。

第一章用受外部激发的回访强度模型(不是严格的霍克斯过程)比较跟进时序:「15 分钟、24 小时、72 小时」达到网格最优增益的 91%,220 个时序中有 33 个达到 90%,最优面很平;扣除退订后,第四封以后几乎没有净收益。第二章发现折扣钩子会教会回头客故意弃单(学习概率 0.6 时一年收入 RM 880,971,低于普通提醒的 RM 882,196),而归因挽回中只有 0.43 是增量。第三章写出沉没数据棘轮,并证明一个人人续费率不变的筛选模型(sBG)能把同一条群组曲线拟合到最大差距 0.011。第四章计算数据导出的代价(只在棘轮模型中存在)与年付方案的自我选择(买家清楚自己的流失时收入 -4.0%)。

第五章改正出处:两档牌照的问题是穆萨-罗森的垄断菜单,不是罗斯柴尔德-斯蒂格利茨的保险市场;菜单把两类客户分开,而申请表的摩擦只有满足单交叉条件时才有甄别作用。第六章计算按评分分配顾问通话(+48% 到 +100%)与可退订金的信号条件。第七章与《孙子·九地》、《鬼谷子》揣篇与摩篇、《墨子·尚贤上》并读,把「揣情」写成问题的信息量(「预算已批准」0.149 比特)。第八章给出完整挽回账本(净收入只有归因的 36%)、区分棘轮与筛选的随机实验与一项预注册的留出实验。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

关键词:购物车弃单;跟进邮件;挽回时序;点过程;霍克斯过程;退订;折扣券;策略性等待;科斯猜想;归因;增量;订阅续费;转换成本;锁定;移位贝塔几何模型;客户留存;筛选效应;数据可携权;年付方案;自我选择;甄别;穆萨-罗森;罗斯柴尔德-斯蒂格利茨;单交叉条件;信号;订金;顾问分配;互信息;孙子;鬼谷子;墨子;预注册

Abstract

When, and how many times, to follow up after a buyer abandons a cart? Does the data subscribers accumulate make renewal rise month by month? How can a business licence at RM 9,800 or RM 29,800 screen clients with menus, application forms and deposits? This book writes these rules of thumb as runnable arithmetic and then asks when they hold. Return rates, unsubscribe rates, renewal parameters, client valuations and close rates are illustrative or synthetic; all data are generated by its programs; the book is not legal advice.

Chapter 1 compares follow-up schedules with an externally excited return-intensity model (not strictly a Hawkes process): "15 minutes, 24 hours, 72 hours" reaches 91% of the best gain on the grid, 33 of 220 schedules reach 90%, and the optimum is flat; net of unsubscribes, messages after the fourth add almost nothing. Chapter 2 finds that discount hooks teach repeat buyers to abandon on purpose (at a learning probability of 0.6 a year's revenue is RM 880,971, below the RM 882,196 of plain reminders), and that only 0.43 of attributed recovery is incremental. Chapter 3 writes down a sunk-data ratchet and shows that a selection model in which everyone's renewal rate is constant (sBG) fits the same cohort curve to within a largest gap of 0.011. Chapter 4 computes the cost of data export (present only in the ratchet model) and the self-selection of annual plans (-4.0% when buyers know their churn).

Chapter 5 corrects a source: the two-licence problem is the monopoly menu of Mussa and Rosen, not the insurance market of Rothschild and Stiglitz; the menu separates the two kinds of client, while the friction of an application form screens only under the single-crossing condition. Chapter 6 computes the allocation of advisory calls by score (+48% to +100%) and when a refundable deposit is a signal. Chapter 7 reads the Sunzi's "Nine Grounds", the Guiguzi's "Chuai" and "Mo" chapters and the Mozi's "Exalting the Worthy I", writing "gauging the dispositions" as the information in a question ("budget approved", 0.149 bits). Chapter 8 gives the full recovery ledger (net only 36% of the attributed figure), a randomised experiment that tells a ratchet from selection, and a pre-registered holdout experiment. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

Keywords: cart abandonment; follow-up emails; recovery timing; point processes; Hawkes process; unsubscribes; discount coupons; strategic waiting; Coase conjecture; attribution; incrementality; subscription renewal; switching costs; lock-in; shifted-beta-geometric model; customer retention; selection effects; data portability; annual plans; self-selection; screening; Mussa-Rosen; Rothschild-Stiglitz; single crossing; signalling; deposits; advisor allocation; mutual information; Sunzi; Guiguzi; Mozi; pre-registration

目录 · Contents

  • 序:没有成交之后、成交之后与大单之前English 中文Preface: After No Sale, After the Sale and Before the Large Sale
  • 第一章 弃单跟进的时序与次数English 中文Chapter 1. The Timing and Number of Follow-Ups after Abandonment
  • 第二章 折扣钩子与被高估的挽回English 中文Chapter 2. Discount Hooks and Overstated Recovery
  • 第三章 沉没数据的续费棘轮,与同样上升的筛选曲线English 中文Chapter 3. A Sunk-Data Renewal Ratchet, and a Selection Curve that Rises the Same Way
  • 第四章 数据导出的代价与年付方案的自我选择English 中文Chapter 4. The Cost of Data Export and the Self-Selection of Annual Plans
  • 第五章 两档牌照的菜单与申请表的甄别English 中文Chapter 5. A Two-Licence Menu and Screening by Application Form
  • 第六章 顾问时间的分配与订金的信号English 中文Chapter 6. Allocating Advisor Time, and Deposits as Signals
  • 第七章 《孙子·九地》《鬼谷子》揣摩与《墨子》量功分禄English 中文Chapter 7. The Sunzi on the Nine Grounds, the Guiguzi on Probing, and the Mozi on Paying by Merit
  • 第八章 完整账本、区分棘轮与筛选的实验,以及预注册的留出实验English 中文Chapter 8. The Full Ledger, an Experiment to Tell a Ratchet from Selection, and a Pre-Registered Holdout

How to cite · 引用

Fan, Y. (2026). Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms: Multi-Pulse Follow-Up Timing, Switching-Cost Accumulation and Screening Equilibria [弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090209

BibTeX
@book{fan2026abandonment,
  title = {{Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms}: Multi-Pulse Follow-Up Timing, Switching-Cost Accumulation and Screening Equilibria},
  author = {Fan, Yafu},
  year = {2026},
  publisher = {5D Library},
  edition = {Version 1.0.0},
  doi = {10.5281/zenodo.24090209},
  url = {https://doi.org/10.5281/zenodo.24090209},
  note = {Chinese title: 弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制}
}
DOIhttps://doi.org/10.5281/zenodo.24090209
DOI(全部版本 all versions)https://doi.org/10.5281/zenodo.24090208
ORCIDhttps://orcid.org/0009-0004-3519-1203
5D Library ID5DL-B-079
版本 Version1.0.0 · 中英双语版 Bilingual edition
出版日期 Date2026-11-08
网址 Onlinehttps://5dlibrary.com/books/abandonment-recovery-kinetics-retention-ratchets-b2b-qualification/
SHA-256 · abandonment-recovery-kinetics-retention-ratchets-b2b-qualification_bilingual_v1.0.0.pdf2f949e660db6597440f552d8e5c36f58dc3b987f423b95adcdf4ccf747365252
SHA-256 · abandonment-recovery-kinetics-retention-ratchets-b2b-qualification_en_v1.0.0.pdfeacee5a81e045eecd8cdafed3c41a2aaffea864aec14f3dc66972f49b00cda8c
SHA-256 · abandonment-recovery-kinetics-retention-ratchets-b2b-qualification_zh_v1.0.0.pdfc86e19d9892e04bc6ec297cea78f0fac16fe560439bdd916e97852e08192f063
Licence · 许可Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0). https://creativecommons.org/licenses/by-nc-nd/4.0/

Disclosure. The author uses the works of 5D Library, including this book, as the methodological basis of his community courses, the 5D Ascension Cards (Dimensional Shift Card Decks) and the Yafu AI knowledge base, and runs a number of websites, paid online reading software, subscriptions, reports, courses, business licences and advisory services whose abandonment follow-ups, renewals and client screening are exactly what this book studies, so he has a direct commercial interest in its subject. The book promotes no software, course, card deck or service, uses no user data from the author's businesses, and accepts no sponsorship. Its parameters are synthetic or illustrative. The experiment in Chapter 8 must follow a pre-registered protocol, and its results will be published whether positive or negative.