What does Abandonment, Renewal and Screening conclude, in numbers, about “Allocating Advisor Time, and Deposits as Signals”?

Answer: Chapter 6 computes the allocation of advisory calls by score (+48% to +100%) and when a refundable deposit is a signal.

Scope of the numbers: 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. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 100, 48

   deal value RM 15,800; call cost RM 350
   score noise 0.5: first come RM 34,912 a week
     top scores RM 69,833 a week (+100%)
   score noise 2.0: first come RM 34,912 a week
     top scores RM 51,628 a week (+48%)
Show the full program
# Chapter 6. p11: Twenty advisory calls a week, sixty applications.
# Each application has a fit score; the true chance of closing is
# logistic(score), and a closed deal is worth RM 9,800 or RM 29,800
# (30% choose plus). A call costs RM 350 of advisor time. Compare
# first-come-first-served with calling the 20 highest scores, when the
# score is informative (noise 0.5) and when it is mostly noise (2.0).
import random
from math import exp

SLOTS, APPS, WEEKS, CALL = 20, 60, 2000, 350.0
DEAL = 0.3 * 29800 + 0.7 * 9800

def week(rng, noise, ranked):
    apps = []
    for _ in range(APPS):
        z = rng.gauss(-2.2, 1.0)
        p = 1 / (1 + exp(-z))
        apps.append((z + rng.gauss(0, noise), p))
    if ranked:
        apps.sort(key=lambda a: -a[0])
    called = apps[:SLOTS]
    return sum(p for _, p in called) * DEAL - SLOTS * CALL

if __name__ == "__main__":
    print("   deal value RM {:,.0f}; call cost RM {:.0f}".format(DEAL, CALL))
    for noise in (0.5, 2.0):
        res = []
        for ranked in (False, True):
            rng = random.Random(79)
            res.append(sum(week(rng, noise, ranked)
                           for _ in range(WEEKS)) / WEEKS)
        print("   score noise {:.1f}: first come RM {:,.0f} a week".format(
            noise, res[0]))
        print("     top scores RM {:,.0f} a week ({:+.0%})".format(
            res[1], res[1] / res[0] - 1))

Single source and citation

Fan, Y. (2026). Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms (Version 1.0.0), Chapter 6: Allocating Advisor Time, and Deposits as Signals. 5D Library. https://doi.org/10.5281/zenodo.24090209

DOI: 10.5281/zenodo.24090209 · Read the monograph · 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}
}

Other chapter answers in this book