What does Payment Routing, Chargebacks and Cash Reserves conclude, in numbers, about “The Cramér-Lundberg Model and the Rolling Reserve”?
Answer: Chapter 5 uses the Cramér-Lundberg model to show that "zero ruin" cannot be bought: a 1% ruin probability needs RM 175,281, and a reserve rate above the net margin rate drains cash continuously.
Scope of the numbers: Chapter 3 writes friendly fraud as a game of deterrence: once the win probability reaches 0.75, false disputes vanish in the illustrative model; in an evidence package the "considered purchase" tick counts least. 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: 175281
reserve RM psi(u) formula ruined within 10 years (sim)
0 0.8000 0.8060
50,000 0.2292 0.2280
100,000 0.0657 0.0722
175,000 0.0101 0.0097
reserve for ruin 1.0%: RM 175,281
reserve for ruin 0.1%: RM 267,384
with loading 0.10: reserve for 1% RM 396,868
with loading 0.50: reserve for 1% RM 100,793Key formula
Show the full program
# Chapter 5. p09: The Cramer-Lundberg model of a cash reserve. Cash
# starts at u and earns net margin c per week; outflow shocks (a batch of
# refunds, chargebacks, a reserve call) arrive as a Poisson process, 2 a
# week, with exponential sizes of mean RM 8,000. Net margin carries a
# safety loading theta = 0.25: c = (1 + theta) * 2 * 8,000. Then the
# probability of EVER running out of cash is exactly
# psi(u) = exp(-theta u / ((1 + theta) mu)) / (1 + theta),
# which is positive for every finite u: zero ruin cannot be bought, only
# a small one. Check by simulation: 4,000 paths of 10 years, seed 85.
import random
from math import exp, log
LAM, MU, THETA = 2.0, 8000.0, 0.25
C = (1 + THETA) * LAM * MU
def psi(u, theta=THETA):
return exp(-theta * u / ((1 + theta) * MU)) / (1 + theta)
def needed(eps, theta=THETA):
return (1 + theta) * MU / theta * log(1 / ((1 + theta) * eps))
def simulate(rng, u, weeks=520):
cash, t = u, 0.0
while True:
dt = rng.expovariate(LAM)
t += dt
if t > weeks:
return False
cash += C * dt - rng.expovariate(1 / MU)
if cash < 0:
return True
if __name__ == "__main__":
rng = random.Random(85)
print(" reserve RM psi(u) formula ruined within 10 years (sim)")
for u in (0.0, 50000.0, 100000.0, 175000.0):
sim = sum(simulate(rng, u) for _ in range(4000)) / 4000
print(" {:10,.0f} {:14.4f} {:.4f}".format(u, psi(u), sim))
for eps in (0.01, 0.001):
print(" reserve for ruin {:.1%}: RM {:,.0f}".format(eps,
needed(eps)))
for th in (0.10, 0.50):
print(" with loading {:.2f}: reserve for 1% RM {:,.0f}".format(
th, needed(0.01, th)))Single source and citation
Fan, Y. (2026). Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds (Version 1.0.0), Chapter 5: The Cramér-Lundberg Model and the Rolling Reserve. 5D Library. https://doi.org/10.5281/zenodo.24090225
DOI: 10.5281/zenodo.24090225 · Read the monograph · 5DL-B-085 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026085,
author = {Fan, Yafu},
title = {Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090225},
url = {https://doi.org/10.5281/zenodo.24090225}
}Other chapter answers in this book
- Chapter 1 · Multi-Acquirer Routing and the Chargeback Red Line
- Chapter 2 · A Ratio Is a Noisy Count, and Refunds Must Beat Disputes
- Chapter 3 · The Defence Game against Friendly Fraud, and Scoring the Evidence
- Chapter 4 · A Cryptographic Evidence Chain, and "Fight or Pre-Empt"
- Chapter 6 · A Formula for the Minimum Safe Reserve, and Spreading over Gateways
- Chapter 7 · Song Maritime Customs Levies, and the Secret Codes and Transfers of the Shanxi Remittance Banks
- Chapter 8 · A Year's Ledger, Stress Tests and a Pre-Registered Experiment