关于「多通道路由与拒付红线」,《支付路由、拒付与现金储备》给出的定量结论是什么?
结论:第一章改正红线的来源:0.9% 是 Visa 已退役的 VDMP 标准门槛,现行的 VAMP 把欺诈报告与争议一起计算,亚太门槛是 1.5%;把风险最高的订单改走扫码,可以把卡通道比率从 0.94% 压到 0.59%;拒付会迟到,看上月比率再反应一年仍有 2.74 个月超线,在结账时按评分预测只有 1.33 个月。
数据口径:书中的订单量、事件率、毛利、退款率、冻结频率与胜诉概率均为示意或合成模型;全部数据由书中程序生成;卡组织规则以写作时的公开资料为准;本书不是法律、财务或合规意见。 第三章把友好欺诈写成威慑博弈:胜诉概率达到 0.75 时虚假争议在示意模型中完全消失;证据包中「理性消费勾选」的分量最小。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.94, 1.33, 2.74
| controller month: 3 4 5 6 7 months > 0.90% | ||
| loose | 0.85% 1.37% 1.90% 1.64% 1.07% | 5.32 |
| react | 0.86% 1.21% 1.35% 0.94% 0.67% | 2.74 |
| checkout | 0.86% 0.76% 0.56% 0.62% 0.79% | 1.33 |
查看完整验算程序
# 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))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《跨境支付智能路由、拒付抗辩博弈与资金池破产边界》第 1 章「多通道路由与拒付红线」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090225
DOI: 10.5281/zenodo.24090225 · 阅读本章所在专著 · 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}
}