What does The Arithmetic of Bargaining, Collection and Escalation conclude, in numbers, about “When to Escalate”?

Answer: Chapter 4 finds the best days to escalate and shows that escalating fully on day 1 cuts net recovery from 0.9450 to 0.5936.

Scope of the numbers: Its parameters are illustrative or synthetic; all calculations are generated by its programs; the book is not legal, financial or employment advice, and empty or unlawful threats are not tactics it endorses. 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. printed values that match the answer: 0.5936, 0.9450

policyt2t3netpromptslowdistr.
reminders onlynevernever0.94501.0000.9980.456
everything on day 1110.59360.4150.9510.593
30/60/90 habit60900.95070.9990.9930.530
best on the grid601050.95080.9990.9960.523
Show the full program
# Chapter 4. p07: When to escalate. One overdue invoice of 1, debtor of
# book A in p05 (prompt-but-late 60%, slow 30%, distressed 10%). Daily
# hazards of paying: 1/15, 1/90, 1/400; distressed debtors also become
# insolvent at 1/250 a day. Three stages:
#   1 friendly reminders from day 0: hazards x 1.5, no cost;
#   2 stop service from day t2: x 3 for prompt and slow, x 1.5 for
#     distressed; costs 0.3 (lost future margin) if the debtor is a
#     prompt-but-late customer still unpaid on day t2;
#   3 lawyer's letter and credit reporting from day t3: x 6 for slow,
#     x 3 for distressed (who now pay this creditor first); costs 0.05
#     plus 0.3 for any prompt customer still unpaid.
# Expected net recovery within 365 days, by exact daily integration;
# grid search over t2 and t3.
KINDS = ((0.6, 1 / 15, 0.0, "prompt"), (0.3, 1 / 90, 0.0, "slow"),
         (0.1, 1 / 400, 1 / 250, "distressed"))
MULT = {"prompt": (1.5, 3.0, 3.0), "slow": (1.5, 3.0, 6.0),
        "distressed": (1.5, 1.5, 3.0)}

def value(t2, t3, days=365, parts=False):
    total, by = 0.0, []
    for share, h0, fail, kind in KINDS:
        alive, got, cost = 1.0, 0.0, 0.0
        for d in range(days):
            if d == t2 and kind == "prompt":
                cost += 0.3 * alive
            if d == t3:
                cost += 0.05 * alive + (0.3 * alive if kind == "prompt"
                                        else 0.0)
            m = MULT[kind]
            k = m[2] if d >= t3 else m[1] if d >= t2 else m[0]
            h = min(1.0, h0 * k)
            got += alive * h
            alive *= (1 - h) * (1 - fail)
        total += share * (got - cost)
        by.append(got - cost)
    return by if parts else total

if __name__ == "__main__":
    never = 10 ** 6
    grid = [(t2, t3) for t2 in range(15, 181, 15)
            for t3 in list(range(t2, 241, 15)) + [never]]
    best = max(grid, key=lambda g: value(*g))
    print("   policy                  t2     t3    net    prompt  slow"
          "   distr.")
    for lab, g in (("reminders only", (never, never)),
                   ("everything on day 1", (1, 1)),
                   ("30/60/90 habit", (60, 90)),
                   ("best on the grid", best)):
        t3 = "never" if g[1] == never else str(g[1])
        t2 = "never" if g[0] == never else str(g[0])
        p = value(*g, parts=True)
        print("   {:<21} {:>5}  {:>5}  {:6.4f}  {:5.3f}  {:5.3f}  {:5.3f}"
              .format(lab, t2, t3, value(*g), *p))

Single source and citation

Fan, Y. (2026). Multistage Ultimatum Bargaining, Accounts-Receivable Decay Kinetics and Optimal Escalation Sequences (Version 1.0.0), Chapter 4: When to Escalate. 5D Library. https://doi.org/10.5281/zenodo.24090245

DOI: 10.5281/zenodo.24090245 · Read the monograph · 5DL-B-094 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026094,
  author    = {Fan, Yafu},
  title     = {Multistage Ultimatum Bargaining, Accounts-Receivable Decay Kinetics and Optimal Escalation Sequences},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090245},
  url       = {https://doi.org/10.5281/zenodo.24090245}
}

Other chapter answers in this book