关于「实践:催收手册、开价与认识一个客户」,《议价、催收与施压的算术》给出的定量结论是什么?
结论:第八章给出催收手册、开价方法,以及凭几张发票无法认识一个客户的道理。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
数据口径:书中的参数均为示意或合成;全部计算由书中程序生成;本书不是法律、财务或劳动关系建议,空洞或违法的威胁不是本书认可的手段。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 16
| on time / invoices | P(r < 0.7) | mean r |
| 1 / 2 | 0.784 | 0.500 |
| 3 / 4 | 0.528 | 0.667 |
| 8 / 10 | 0.313 | 0.750 |
| 16 / 20 | 0.198 | 0.773 |
| 80 / 100 | 0.014 | 0.794 |
查看完整验算程序
# Chapter 8. p16: How many invoices before a client is known? A client
# pays on time with chance r. Starting from a uniform prior, k on-time
# payments out of n give a Beta(k + 1, n - k + 1) posterior. The chance
# that r is below 0.7 (a client to put on stricter terms), and the
# posterior mean, after a few histories. Exact, by numerical
# integration on a grid of 20,000 points.
def post(k, n, cut=0.7, m=20000):
xs = [(i + 0.5) / m for i in range(m)]
w = [x ** k * (1 - x) ** (n - k) for x in xs]
z = sum(w)
below = sum(wi for x, wi in zip(xs, w) if x < cut) / z
mean = sum(x * wi for x, wi in zip(xs, w)) / z
return below, mean
if __name__ == "__main__":
print(" on time / invoices P(r < 0.7) mean r")
for k, n in ((1, 2), (3, 4), (8, 10), (16, 20), (80, 100)):
b, mu = post(k, n)
print(" {:>7} / {:<9} {:10.3f} {:6.3f}".format(k, n, b, mu))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《多阶段最后通牒议价、应收账款衰减动力学与最优施压序列》第 8 章「实践:催收手册、开价与认识一个客户」(版本 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}
}