What does Reactivation, Thresholds and Flash Clearance conclude, in numbers, about “Margin Design of Spend-and-Save Ladders: Where the Savings Leak”?

Answer: Most of what a spend-and-save ladder gives away leaks to customers who were already above the step. Under illustrative parameters, the respectable ladder "spend 150 save 10, spend 250 save 25, spend 400 save 50" raises revenue slightly and lowers margin clearly; every ringgit of margin earned back from added items costs 4.27 ringgit of savings on the first step and 21.90 on the third. A ladder designed for revenue almost always loses margin. A ladder designed for margin has small savings and high steps, and is worth having only when the top-up zone holds real tail stock.

Scope of the numbers: Parameters are illustrative and correspond to no real customer, order or supplier of HOMIE-X, every price in the book is illustrative, and all calculations are generated by the book's programs. This is general business analysis, not personalised business, tax or legal advice.

中文版

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: 150, 21.90, 250, 4.27, 400

tier            share   saving/visitor  filler margin  net
below 150       0.7678     0.0000        0.0000      +0.0000
150 / -10       0.1905     1.9049        0.4461      -1.4588
250 / -25       0.0379     0.9469        0.0948      -0.8520
400 / -50       0.0038     0.1909        0.0087      -0.1822
saving rate per tier: 0.067, 0.100, 0.125
saving given per RM of filler margin: 4.27, 9.98, 21.90
no ladder: margin 29.664  revenue 98.88 per visitor
ladder   : margin 27.171  revenue 99.50 per visitor
change   : margin -2.493  revenue +0.62
filler margin 0.30: margin change -1.943
filler margin 0.45: margin change -1.394
Show the full program
# Chapter 5. p51: a spend-and-save ladder, tier by tier, in margin terms.
# Ladder (illustrative): spend RM 150 save RM 10, RM 250 save RM 25,
# RM 400 save RM 50. Intended basket lognormal (median RM 85, log-sd
# 0.55), item margin 0.30, filler margin 0.15, top-up to the next tier
# with chance (1 - exp(-saving / PSI)) * exp(-gap / 25), PSI = RM 8 (the
# pull of the saving saturates), filler = gap + 4. Shipping is left out
# (chapter 4 handles it). A buyer already past a tier gets its saving
# whether or not the ladder moved her: that is the leak. Per tier we
# report: share of visitors ending there, leak, filler margin, net.
import math

MED, SD, MU, MUF, DELTA, OVER = 85.0, 0.55, 0.30, 0.15, 25.0, 4.0
PSI = 8.0
LADDER = [(150.0, 10.0), (250.0, 25.0), (400.0, 50.0)]
Z = [i / 200.0 for i in range(-1200, 1201)]
WZ = [math.exp(-z * z / 2.0) / math.sqrt(2.0 * math.pi) / 200.0 for z in Z]
BASKETS = [MED * math.exp(SD * z) for z in Z]


def tier_of(b, ladder):
    k = -1
    for j, (t, _) in enumerate(ladder):
        if b >= t:
            k = j
    return k


def evaluate(ladder, mu=MU, muf=MUF):
    nt = len(ladder)
    share = [[] for _ in range(nt + 1)]
    leak = [[] for _ in range(nt + 1)]
    fill = [[] for _ in range(nt + 1)]
    marg, rev = [], []
    for w, b in zip(WZ, BASKETS):
        k = tier_of(b, ladder)
        d_now = ladder[k][1] if k >= 0 else 0.0
        if k + 1 < nt:
            t_next, d_next = ladder[k + 1]
            gap = t_next - b
            tau = (1.0 - math.exp(-d_next / PSI)) * \
                math.exp(-gap / DELTA)
        else:
            tau, gap, d_next = 0.0, 0.0, 0.0
        if k + 1 < nt:          # topped up: lands on tier k + 1
            share[k + 2].append(w * tau)
            fill[k + 2].append(w * tau * muf * (gap + OVER))
            leak[k + 2].append(w * tau * d_next)
        share[k + 1].append(w * (1.0 - tau))
        leak[k + 1].append(w * (1.0 - tau) * d_now)
        marg.append(w * (mu * b + tau * (muf * (gap + OVER) - d_next)
                         - (1.0 - tau) * d_now))
        rev.append(w * (b + tau * (gap + OVER - d_next)
                        - (1.0 - tau) * d_now))
    return ([math.fsum(x) for x in share], [math.fsum(x) for x in leak],
            [math.fsum(x) for x in fill], math.fsum(marg), math.fsum(rev))


if __name__ == "__main__":
    base_m = math.fsum(w * MU * b for w, b in zip(WZ, BASKETS))
    base_r = math.fsum(w * b for w, b in zip(WZ, BASKETS))
    share, leak, fill, m, r = evaluate(LADDER)
    print("tier            share   saving/visitor  filler margin  net")
    names = ["below 150", "150 / -10", "250 / -25", "400 / -50"]
    for j in range(4):
        print("{:<12}    {:.4f}     {:.4f}        {:.4f}      {:+.4f}"
              .format(names[j], share[j], leak[j], fill[j],
                      fill[j] - leak[j]))
    print("saving rate per tier: " + ", ".join(
        "{:.3f}".format(d / t) for t, d in LADDER))
    print("saving given per RM of filler margin: " + ", ".join(
        "{:.2f}".format(leak[j] / fill[j]) for j in range(1, 4)))
    print("no ladder: margin {:.3f}  revenue {:.2f} per visitor".format(
        base_m, base_r))
    print("ladder   : margin {:.3f}  revenue {:.2f} per visitor".format(m, r))
    print("change   : margin {:+.3f}  revenue {:+.2f}".format(
        m - base_m, r - base_r))
    for muf in (0.30, 0.45):
        _, _, _, m2, _ = evaluate(LADDER, muf=muf)
        base2 = base_m
        print("filler margin {:.2f}: margin change {:+.3f}".format(
            muf, m2 - base2))

Single source and citation

Fan, Y. (2026). Repeat-Buyer Reactivation in Private-Channel Commerce, Threshold Bundle Margin Design and Flash-Clearance Dynamics (Version 1.0.0), Chapter 5: Margin Design of Spend-and-Save Ladders: Where the Savings Leak. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-353 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026353,
  author    = {Fan, Yafu},
  title     = {Repeat-Buyer Reactivation in Private-Channel Commerce, Threshold Bundle Margin Design and Flash-Clearance Dynamics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book