What does Abandonment, Renewal and Screening conclude, in numbers, about “Discount Hooks and Overstated Recovery”?

Answer: 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.

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: 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
Show the full program
# 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]))

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 2: Discount Hooks and Overstated Recovery. 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