What does Payment Routing, Chargebacks and Cash Reserves conclude, in numbers, about “A Ratio Is a Noisy Count, and Refunds Must Beat Disputes”?
Answer: Chapter 2 shows that a ratio is a noisy count, and finds that refunding within 1 day brings 227 fewer disputes than within 14 days.
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: 14, 227
| refund within (days) | disputes | added to ratio | cost RM |
|---|---|---|---|
| 1 | 54 | 0.50% | 93,263 |
| 3 | 135 | 1.25% | 98,121 |
| 7 | 226 | 2.09% | 103,561 |
| 14 | 282 | 2.61% | 106,905 |
| refunding in 1 day instead of 14 avoids 227 disputes |
Show the full program
# Chapter 2. p04: Refund before they dispute. In a peak month 600 of
# 12,000 buyers (10,800 settled on cards) ask for their money back. A
# buyer still waiting t days after asking files a dispute with
# probability 0.5 * (1 - exp(-t / 5)). A dispute almost always goes the
# buyer's way ("credit not processed"): the merchant loses the RM 150
# anyway, plus a RM 60 fee, and the dispute counts in the monitored ratio.
from math import exp
ASK, CARD, TICKET, FEE = 600, 10800, 150.0, 60.0
def month(t):
d = ASK * 0.5 * (1 - exp(-t / 5.0))
cost = ASK * TICKET + d * FEE
return d, d / CARD, cost
if __name__ == "__main__":
print(" refund within (days) disputes added to ratio cost RM")
for t in (1, 3, 7, 14):
d, r, c = month(t)
print(" {:20d} {:8.0f} {:14.2%} {:7,.0f}".format(t, d, r, c))
d1, d14 = month(1)[0], month(14)[0]
print(" refunding in 1 day instead of 14 avoids {:.0f} disputes"
.format(d14 - d1))Single source and citation
Fan, Y. (2026). Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds (Version 1.0.0), Chapter 2: A Ratio Is a Noisy Count, and Refunds Must Beat Disputes. 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 3 · The Defence Game against Friendly Fraud, and Scoring the Evidence
- Chapter 4 · A Cryptographic Evidence Chain, and "Fight or Pre-Empt"
- Chapter 5 · The Cramér-Lundberg Model and the Rolling Reserve
- 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