What does Subscription Stacking, Dunning and Annual Plans conclude, in numbers, about “Failed Charges: Decline Reasons and Retry Schedules for Involuntary Churn”?

Answer: Chapter 4 classifies passive churn into insufficient funds, expired cards, risk declines and hard declines and schedules retries within public card-network caps, lifting recovery of all failures from 0.232 to 0.627; recovering seven tenths lifts the ceiling to 1.762 times its level. Hard declines are never retried, and card details stay with licensed payment institutions.

Scope of the numbers: Its subscriber counts, prices, churn, recovery and discount rates are illustrative, all calculations are generated by its programs, and none corresponds to a real customer or transaction. It is not legal, accounting, tax or investment advice and promises no level of income; "steady" means only that revenue can be anticipated, with premises and failure conditions stated.

中文版

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.232, 0.627

reasonnaive 0,1,2,3best days (cap 4)bestcap 2
insufficient0.2807,9,10,130.8900.751
expired0.21810,11,12,130.6600.659
risk0.2861,2,3,40.3440.190
hard (0.12)never retried: ask the holder for a new card
all failures, naive schedule0.232
all failures, best schedules0.627
Show the full program
# Chapter 4. p42: best retry days by decline reason under an attempt cap.
# Day 0 is the failed renewal charge; retries may use days 0 to 13 and
# at most 4 attempts (an internal cap set well inside the public network
# limits, which change over time). Hard declines are never retried.
# Insufficient funds: funds arrive on day D (illustrative weights; 0.08
# of cases fall after day 13); before D an attempt succeeds 0.03, from D
# on 0.85 * 0.93 ** (t - D); weekend days 4, 5, 11, 12 multiply by 0.9.
# Expired card: the holder updates details after a notice with daily
# hazard 0.08; an attempt after the update succeeds 0.95, before it 0.
# Risk decline: 0.10 per attempt, 0.02 if made on day 0. Because only a
# failure leads to the next attempt, a fixed day set is a full policy,
# so exhaustive enumeration with itertools is exact. All illustrative.
# Chapter 4 hypothesis: funds-day timing lifts recovery by >= 0.20.
import itertools
import math

DAYS, CAP = 14, 4
W = (0.02, 0.05, 0.06, 0.07, 0.08, 0.10, 0.12, 0.12, 0.10, 0.08, 0.05,
     0.03, 0.02, 0.02)
LATE = 1.0 - math.fsum(W)
WEEKEND = (4, 5, 11, 12)


def p_if(t, d):
    p = 0.03 if t < d else 0.85 * 0.93 ** (t - d)
    return p * (0.9 if t in WEEKEND else 1.0)


def rec_if(days):
    terms = []
    for d, w in enumerate(W):
        miss = 1.0
        for t in days:
            miss *= 1.0 - p_if(t, d)
        terms.append(w * (1.0 - miss))
    miss = 1.0
    for t in days:
        miss *= 0.97
    terms.append(LATE * (1.0 - miss))
    return math.fsum(terms)


def rec_exp(days):
    terms = []
    for u in range(DAYS):
        w = 0.08 * 0.92 ** u
        miss = 1.0
        for t in days:
            if t > u:
                miss *= 0.05
        terms.append(w * (1.0 - miss))
    return math.fsum(terms)


def rec_risk(days):
    miss = 1.0
    for t in days:
        miss *= 1.0 - (0.02 if t == 0 else 0.10)
    return 1.0 - miss


def best(fn, cap):
    top = ((), 0.0)
    for k in range(1, cap + 1):
        for days in itertools.combinations(range(DAYS), k):
            v = fn(days)
            if v > top[1] + 1e-12:
                top = (days, v)
    return top


MIX = (("insufficient", 0.45, rec_if), ("expired", 0.25, rec_exp),
       ("risk", 0.18, rec_risk))
naive = (0, 1, 2, 3)
print("reason         naive 0,1,2,3   best days (cap 4)   best   cap 2")
tot_n, tot_b = [], []
for name, share, fn in MIX:
    days, v = best(fn, CAP)
    v2 = best(fn, 2)[1]
    tot_n.append(share * fn(naive))
    tot_b.append(share * v)
    print("%-13s  %13.3f   %-18s  %5.3f  %5.3f" % (
        name, fn(naive), ",".join(str(d) for d in days), v, v2))
print("hard (0.12)    never retried: ask the holder for a new card")
print("all failures, naive schedule   %.3f" % math.fsum(tot_n))
print("all failures, best schedules   %.3f" % math.fsum(tot_b))

Single source and citation

Fan, Y. (2026). Stacking Monthly Recurring Revenue, Involuntary-Churn Dunning Recovery and Upfront Annual Cash Lock-In (Version 1.0.0), Chapter 4: Failed Charges: Decline Reasons and Retry Schedules for Involuntary Churn. 5D Library. DOI pending

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

BibTeX
@book{fan2026367,
  author    = {Fan, Yafu},
  title     = {Stacking Monthly Recurring Revenue, Involuntary-Churn Dunning Recovery and Upfront Annual Cash Lock-In},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book