关于「友好欺诈的抗辩博弈与证据评分」,《支付路由、拒付与现金储备》给出的定量结论是什么?

结论:第三章把友好欺诈写成威慑博弈:胜诉概率达到 0.75 时虚假争议在示意模型中完全消失;证据包中「理性消费勾选」的分量最小。

数据口径:书中的订单量、事件率、毛利、退款率、冻结频率与胜诉概率均为示意或合成模型;全部数据由书中程序生成;卡组织规则以写作时的公开资料为准;本书不是法律、财务或合规意见。 第三章把友好欺诈写成威慑博弈:胜诉概率达到 0.75 时虚假争议在示意模型中完全消失;证据包中「理性消费勾选」的分量最小。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.75

win probshare who disputefalse disputesloss RM (by hand / auto)
0.200.91727541,250 / 37,125
0.350.66720030,000 / 22,500
0.500.41712516,875 / 11,250
0.600.250759,000 / 5,625
0.750.00000 / 0
no tempted buyer disputes once w >= 0.75
查看完整验算程序
# 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))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《跨境支付智能路由、拒付抗辩博弈与资金池破产边界》第 3 章「友好欺诈的抗辩博弈与证据评分」(版本 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}
}

本书其他章节结论