What does The Arithmetic of Bargaining, Collection and Escalation conclude, in numbers, about “Why Overdue Invoices Look Less Collectible Every Month”?

Answer: Chapter 3 shows that the collectible share of overdue invoices falls month by month even when no debtor changes: of invoices still open on day 90, 0.697 are eventually paid in one book and 0.478 in a riskier one.

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. standard-library Python onlyprinted values that match the answer: 0.478, 0.697, 90

daysbook A: unpaidcollectiblebook B: unpaidcollectible
01.0000.9391.0000.816
300.3910.8450.5430.660
600.2580.7650.4180.559
900.2000.6970.3530.478
1800.1140.4690.2560.279
3650.0680.1110.1990.071
Show the full program
# Chapter 3. p05: Why overdue invoices look less collectible every
# month. 10,000 overdue invoices of equal size. Debtors are of three
# kinds: prompt-but-late (pay with hazard 1/15 a day), slow (1/90 a
# day) and distressed (1/400 a day, and each day a 1/250 chance of
# becoming insolvent, after which nothing is paid). Nobody's own hazard
# changes with time. Book A: 60% / 30% / 10%. Book B, a riskier book:
# 40% / 30% / 30%. For invoices still unpaid on day t, the share
# eventually collected within two years. Seed 94.
import random

RATES = ((1 / 15, 0.0), (1 / 90, 0.0), (1 / 400, 1 / 250))

def invoice(rng, mix):
    u, k = rng.random(), 0
    while u >= mix[k]:
        u -= mix[k]
        k += 1
    pay, fail = RATES[k]
    t_pay = rng.expovariate(pay)
    t_fail = rng.expovariate(fail) if fail else 1e9
    return t_pay if t_pay < min(t_fail, 730) else None

def table(rng, mix):
    inv = [invoice(rng, mix) for _ in range(10000)]
    rows = []
    for t in (0, 30, 60, 90, 180, 365):
        open_ = [x for x in inv if x is None or x > t]
        col = sum(1 for x in open_ if x is not None) / len(open_)
        rows.append((t, len(open_) / len(inv), col))
    return rows

if __name__ == "__main__":
    rng = random.Random(94)
    a = table(rng, (0.6, 0.3, 0.1))
    b = table(rng, (0.4, 0.3, 0.3))
    print("   days     book A: unpaid  collectible   book B: unpaid"
          "  collectible")
    for (t, ua, ca), (_, ub, cb) in zip(a, b):
        print("   {:4d}   {:14.3f}  {:11.3f}   {:14.3f}  {:11.3f}".format(
            t, ua, ca, ub, cb))

Single source and citation

Fan, Y. (2026). Multistage Ultimatum Bargaining, Accounts-Receivable Decay Kinetics and Optimal Escalation Sequences (Version 1.0.0), Chapter 3: Why Overdue Invoices Look Less Collectible Every Month. 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