5D Library › Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds · 中文

Chapter 2. A Ratio Is a Noisy Count, and Refunds Must Beat Disputes

A small merchant’s ratio jumps by itself

A month’s number of events is a random count. For a merchant whose true event rate is 0.60%, the fewer card transactions settled each month, the more easily the observed ratio crosses a line by chance. Treating each month’s count as Poisson, the probability of crossing by chance can be computed.

Calculation

# Chapter 2. p03: A ratio is a noisy count. A merchant whose true event
# rate is 0.60% (or 0.75%) settles N card sales a month; the monthly count
# of events is Poisson with mean rate * N. How often does the observed
# ratio exceed 0.90% (the old Visa VDMP "standard" line, which also needed
# at least 100 disputes) or 1.50% (the VAMP "excessive" line for Asia
# Pacific merchants from April 2026, which needs 1,500 events a month)?
from math import ceil, exp, lgamma, log

def tail(mean, k):
    """P(X >= k) for X ~ Poisson(mean), summed upward in log space."""
    total, i = 0.0, k
    while True:
        t = exp(i * log(mean) - mean - lgamma(i + 1))
        total += t
        if i > mean and t < 1e-15:
            return min(1.0, total)
        i += 1

if __name__ == "__main__":
    print("   card sales   P(ratio > 0.90%)        P(ratio > 1.50%)")
    print("   per month    true 0.60%  true 0.75%  true 0.75%")
    for n in (2000, 5000, 20000, 100000):
        k9 = int(0.009 * n) + 1
        k15 = int(0.015 * n) + 1
        print("   {:10,d}   {:10.4f}  {:10.4f}  {:10.4f}".format(
            n, tail(0.006 * n, k9), tail(0.0075 * n, k9),
            tail(0.0075 * n, k15)))
    for need, line in ((100, 0.009), (1500, 0.015)):
        print("   floor of {:,} events: hit at {:.2%} from {:,} sales/month"
              .format(need, line, ceil(need / line)))
#    card sales   P(ratio > 0.90%)        P(ratio > 1.50%)
#    per month    true 0.60%  true 0.75%  true 0.75%
#         2,000       0.0374      0.1805      0.0002
#         5,000       0.0040      0.0985      0.0000
#        20,000       0.0000      0.0076      0.0000
#       100,000       0.0000      0.0000      0.0000
#    floor of 100 events: hit at 0.90% from 11,112 sales/month
#    floor of 1,500 events: hit at 1.50% from 100,000 sales/month

With 2,000 card transactions a month, a merchant with a true event rate of 0.60% observes a ratio above 0.9% in a given month with probability 0.0374; with a true rate of 0.75%, with probability 0.1805. At 20,000 a month the latter falls to 0.0076. The old VDMP also required at least 100 disputes, which at a 0.9% ratio takes 11,112 card transactions a month; VAMP in Asia Pacific requires at least 1,500 events, which at a 1.5% ratio takes 100,000 card transactions a month.

Note

Being below the card networks’ formal monitoring is not the same as being safe. The count floors mean small merchants are seldom placed in formal monitoring by the networks, but acquirers and gateways usually freeze payouts or demand reserves under ratio and count rules of their own. Chapters 5 and 6 compute what such freezes do to cash.

Refunds must beat disputes

Many chargebacks come from buyers who could have been refunded: they ask for a refund, hear nothing, and dispute with their bank. Suppose that in a peak month 600 buyers ask for a refund, and a buyer still unrefunded after tt days disputes with probability 0.5(1−e−t/5)0.5(1-e^{-t/5}). Disputes almost always go the buyer’s way (“credit not processed”): the merchant loses the RM 150 anyway, pays a RM 60 fee, and the dispute counts in the monitored ratio.

Calculation

# 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))
#    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

Refunding within 1 day, the peak month still sees 54 disputes, adding 0.50% to the ratio; within 7 days, 226 disputes, adding 2.09%; within 14 days, 282, adding 2.61%. Cutting from 14 days to 1 avoids 227 disputes. In cash the difference is modest (RM 93,263 against RM 106,905), but for the ratio, slow refunds alone are enough to push a merchant over any red line.

Hypothesis · not established

The author’s hypothesis (not yet tested): for merchants of digital products, changing the refund promise from “within 7 working days” to “handled within 24 hours” cuts the number of disputes in the next quarter by at least three tenths. What would show it wrong: in a trial assigning the refund deadline at random by order, the dispute rates differ by less than three tenths.

Summary

A ratio is a noisy count: the fewer card transactions a month, the more easily it crosses a line by chance, and the networks’ count floors keep small merchants out of formal monitoring, though acquirers apply rules of their own. The cheapest chargeback control is fast refunds: in the illustrative peak month, refunding within 1 day brings 227 fewer disputes than within 14 days.

Fan, Y. (2026). Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds: Multi-Acquirer Success Optimization, Dispute Evidence Scoring and Cramér-Lundberg Cash Reserves [跨境支付智能路由、拒付抗辩博弈与资金池破产边界] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090225 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).