What does Payment Routing, Chargebacks and Cash Reserves conclude, in numbers, about “The Defence Game against Friendly Fraud, and Scoring the Evidence”?
Answer: 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.
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. printed values that match the answer: 0.75
| win prob | share who dispute | false disputes | loss RM (by hand / auto) |
|---|---|---|---|
| 0.20 | 0.917 | 275 | 41,250 / 37,125 |
| 0.35 | 0.667 | 200 | 30,000 / 22,500 |
| 0.50 | 0.417 | 125 | 16,875 / 11,250 |
| 0.60 | 0.250 | 75 | 9,000 / 5,625 |
| 0.75 | 0.000 | 0 | 0 / 0 |
| no tempted buyer disputes once w >= 0.75 |
Show the full program
# Chapter 3. p05: Friendly fraud as a game. A buyer who received the
# product (a RM 150 digital report) can falsely claim "not authorised" or
# "not received". If the merchant fights the dispute with evidence and
# wins (probability w), the buyer pays the money back and loses access to
# the account, a cost to him of RM 50. Buyers differ in the hassle cost h
# of disputing, uniform on RM 0 to 120. A buyer disputes when
# 150 * (1 - w) - 50 * w > h.
# The merchant fights when w * 150 exceeds the cost of preparing the
# case: RM 60 by hand, RM 15 with an automatic evidence package.
# 3% of buyers are tempted; per 10,000 orders.
A, BAN, HMAX, TEMPTED = 150.0, 50.0, 120.0, 0.03
def dispute_share(w):
gain = A * (1 - w) - BAN * w
return min(1.0, max(0.0, gain / HMAX))
def loss(w, prep):
q = dispute_share(w)
n = 10000 * TEMPTED * q
if w * A > prep:
return q, n, n * (prep + (1 - w) * A)
return q, n, n * A
if __name__ == "__main__":
print(" win prob share who dispute false disputes loss RM"
" (by hand / auto)")
for w in (0.2, 0.35, 0.5, 0.6, 0.75):
q, n, l1 = loss(w, 60.0)
_, _, l2 = loss(w, 15.0)
print(" {:8.2f} {:17.3f} {:14.0f} {:7,.0f} / {:,.0f}".format(
w, q, n, l1, l2))
w0 = A / (A + BAN)
print(" no tempted buyer disputes once w >= {:.2f}".format(w0))Single source and citation
Fan, Y. (2026). Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds (Version 1.0.0), Chapter 3: The Defence Game against Friendly Fraud, and Scoring the Evidence. 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 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