关于「耐心、截止期限与公平」,《议价、催收与施压的算术》给出的定量结论是什么?

结论:双方耐心都是 0.9 时,先出价方得到 0.526;都是 0.99 时得到 0.503,几乎平分。耐心就是力量:耐心 0.95 的先出价方面对耐心只有 0.8 的一方,得到 0.833,反过来只得到 0.208。拒绝之后谈判破裂的风险,对双方都像缺乏耐心,并有利于先出手的一方:破裂风险 0.05 时先出价方的份额升到 0.515,0.2 时升到 0.558。在催收或价格谈判中,等得起的一方,例如有别的客户的供应商,或者不急需这家供应商的债务人,握着较强的牌。

数据口径:书中的参数均为示意或合成;全部计算由书中程序生成;本书不是法律、财务或劳动关系建议,空洞或违法的威胁不是本书认可的手段。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

d1 (proposer) d2 (other) proposer's share
0.900.90 0.526
0.990.99 0.503
0.950.80 0.833
0.800.95 0.208
breakdown risk b with d1 = d20.99
b0.00: proposer's share 0.503
b0.05: proposer's share 0.515
b0.20: proposer's share 0.558
查看完整验算程序
# Chapter 2. p03: Rubinstein's alternating offers. Two sides split a
# surplus of 1, making offers in turn; each round of delay shrinks the
# value to side i by the factor d_i. In the unique subgame-perfect
# equilibrium the first proposer gets (1 - d2) / (1 - d1 d2) at once.
# With a chance b that talks break down after any rejection, each
# side's effective factor becomes d_i (1 - b).
def share(d1, d2):
    return (1 - d2) / (1 - d1 * d2)

if __name__ == "__main__":
    print("   d1 (proposer)   d2 (other)   proposer's share")
    for d1, d2 in ((0.9, 0.9), (0.99, 0.99), (0.95, 0.8), (0.8, 0.95)):
        print("   {:13.2f}   {:10.2f}   {:16.3f}".format(d1, d2,
                                                         share(d1, d2)))
    print("   breakdown risk b with d1 = d2 = 0.99")
    for b in (0.0, 0.05, 0.2):
        e = 0.99 * (1 - b)
        print("   b = {:.2f}: proposer's share {:.3f}".format(b, share(e, e)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《多阶段最后通牒议价、应收账款衰减动力学与最优施压序列》第 2 章「耐心、截止期限与公平」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090245

DOI: 10.5281/zenodo.24090245 · 阅读本章所在专著 · 5DL-B-094 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026094,
  author    = {Fan, Yafu},
  title     = {Multistage Ultimatum Bargaining, Accounts-Receivable Decay Kinetics and Optimal Escalation Sequences},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090245},
  url       = {https://doi.org/10.5281/zenodo.24090245}
}

本书其他章节结论