What does Payment Routing, Chargebacks and Cash Reserves conclude, in numbers, about “Multi-Acquirer Routing and the Chargeback Red Line”?

Answer: Chapter 1 corrects where the red line comes from: 0.9% was the standard threshold of Visa's retired VDMP, while the current VAMP counts fraud reports and disputes together, with an Asia Pacific threshold of 1.5%; steering the riskiest orders to QR lowers the card ratio from 0.94% to 0.59%; chargebacks arrive late, so reacting to last month's ratio still leaves 2.74 months a year above the line, against 1.33 when predicting from scores at checkout.

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: 0.94, 1.33, 2.74

controller month: 3 4 5 6 7 months > 0.90%
loose0.85% 1.37% 1.90% 1.64% 1.07%5.32
react0.86% 1.21% 1.35% 0.94% 0.67%2.74
checkout0.86% 0.76% 0.56% 0.62% 0.79%1.33
Show the full program
# Chapter 1. p02: Disputes arrive late. Of the fraud reports and disputes
# that a month's card sales will bring, 45% are reported that month, 40%
# the next and 15% the month after; the monitored ratio divides the
# events REPORTED in a month by the card sales SETTLED in it. 12,000
# orders a month in the segments of p01; in months 4 and 5 a fraud ring
# adds 1,500 orders a month that score in the riskiest segment, with an
# event rate of 15% if they reach cards (QR completion 5%). Routings:
# loose = the 0.90% routing of p01, strict = segments 4 and 5 half and
# none on cards. Controllers: always loose; react to LAST month's
# observed ratio (> 0.90% -> strict next month); score orders at checkout
# and go strict in any month whose expected ratio exceeds 0.90%.
# 300 simulated years each, seed 85 (counts drawn from normal or
# Poisson approximations to the binomial).
import random
from math import exp

SHARE = (0.40, 0.25, 0.15, 0.12, 0.08)
RATE = (0.002, 0.004, 0.008, 0.02, 0.05)
LOOSE = (1.0, 1.0, 1.0, 1.0, 0.75)
STRICT = (1.0, 1.0, 1.0, 0.5, 0.0)
LAG = (0.45, 0.40, 0.15)

def binom(rng, n, p):
    """Binomial draw: normal for large counts, Poisson for rare events."""
    v = n * p * (1 - p)
    if v > 30:
        return min(n, max(0, round(n * p + v ** 0.5 * rng.gauss(0, 1))))
    lam, k, u = n * p, 0, rng.random()
    term = exp(-lam)
    cum = term
    while u > cum and k < n:
        k += 1
        term *= lam / k
        cum += term
    return k

def month_orders(m):
    rows = [(12000 * s, r) for s, r in zip(SHARE, RATE)]
    attack = 1500 if m in (4, 5) else 0
    return rows, attack

def expected_ratio(m, x):
    rows, attack = month_orders(m)
    sales = sum(n * x[i] * 0.9 for i, (n, r) in enumerate(rows))
    ev = sum(n * x[i] * 0.9 * r for i, (n, r) in enumerate(rows))
    sales += attack * x[4] * 0.9
    ev += attack * x[4] * 0.9 * 0.15
    return ev / sales

def year(rng, rule):
    pipe = [0.0] * 15
    obs, prev = [], 0.0
    for m in range(1, 13):
        if rule == "loose":
            x = LOOSE
        elif rule == "react":
            x = STRICT if prev > 0.009 else LOOSE
        else:
            x = STRICT if expected_ratio(m, LOOSE) > 0.009 else LOOSE
        rows, attack = month_orders(m)
        sales = 0
        for i, (n, r) in enumerate(rows):
            k = binom(rng, int(n * x[i]), 0.9)
            sales += k
            ev = binom(rng, k, r)
            for j, w in enumerate(LAG):
                pipe[m + j] += ev * w
        k = binom(rng, int(attack * x[4]), 0.9)
        sales += k
        ev = binom(rng, k, 0.15)
        for j, w in enumerate(LAG):
            pipe[m + j] += ev * w
        prev = pipe[m] / sales
        obs.append(prev)
    return obs

if __name__ == "__main__":
    rng = random.Random(85)
    print("   controller     month: 3     4     5     6     7"
          "   months > 0.90%")
    for rule in ("loose", "react", "checkout"):
        runs = [year(rng, rule) for _ in range(300)]
        mean = [sum(r[m] for r in runs) / 300 for m in range(12)]
        over = sum(sum(1 for v in r if v > 0.009) for r in runs) / 300
        print("   {:<10} {}   {:.2f}".format(rule, " ".join(
            "{:5.2%}".format(mean[m]) for m in range(2, 7)), over))

Single source and citation

Fan, Y. (2026). Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds (Version 1.0.0), Chapter 1: Multi-Acquirer Routing and the Chargeback Red Line. 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