关于「两档牌照的菜单与申请表的甄别」,《弃单、续费与大单筛选》给出的定量结论是什么?
结论:「用一份长申请表把不合适的客户挡在门外」,只有在一个条件下成立:不合适的客户每多一道问题就更容易放弃。这就是甄别理论中的单交叉条件。若两类客户每道问题都有 0.04 的人放弃,10 道问题之后高合适度客户从 200 人降到 133.0 人,低合适度从 800 人降到 531.9 人,比例仍然是 0.200:摩擦只是赶走了客户。若高合适度客户每道题放弃 0.03、低合适度 0.08,10 道题后比例升到 0.298;若前者是 0.06,只升到 0.237,而高合适度客户损失近半(剩 107.7 人)。
数据口径:书中的回访率、退订率、续费参数、客户估值与成交率均为示意或合成模型;全部数据由书中程序生成;本书不是法律意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.03, 0.04, 0.06, 0.08, 0.200, 0.237
| drop per question: high 0.04, low 0.04 | |
| 0 questions | 200.0 high, 800.0 low, high share 0.200 |
| 5 questions | 163.1 high, 652.3 low, high share 0.200 |
| 10 questions | 133.0 high, 531.9 low, high share 0.200 |
| drop per question: high 0.03, low 0.08 | |
| 0 questions | 200.0 high, 800.0 low, high share 0.200 |
| 5 questions | 171.7 high, 527.3 low, high share 0.246 |
| 10 questions | 147.5 high, 347.5 low, high share 0.298 |
| drop per question: high 0.06, low 0.08 | |
| 0 questions | 200.0 high, 800.0 low, high share 0.200 |
| 5 questions | 146.8 high, 527.3 low, high share 0.218 |
| 10 questions | 107.7 high, 347.5 low, high share 0.237 |
查看完整验算程序
# Chapter 5. p10: Does a longer application form screen for fit? Prior
# share of high-fit applicants 0.20. Each extra question makes a share
# of applicants give up: d_high for high-fit, d_low for low-fit. Friction
# improves the mix only if d_low > d_high (the single-crossing condition
# of screening); with equal drop rates it only loses applicants.
PRIOR = 0.20
def after(k, d_high, d_low, n=1000):
h = n * PRIOR * (1 - d_high) ** k
l = n * (1 - PRIOR) * (1 - d_low) ** k
return h, l
if __name__ == "__main__":
for d_high, d_low in ((0.04, 0.04), (0.03, 0.08), (0.06, 0.08)):
print(" drop per question: high {:.2f}, low {:.2f}".format(
d_high, d_low))
for k in (0, 5, 10):
h, l = after(k, d_high, d_low)
print(" {:2d} questions: {:5.1f} high, {:5.1f} low,"
" high share {:.3f}".format(k, h, l, h / (h + l)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制》第 5 章「两档牌照的菜单与申请表的甄别」(版本 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}
}