关于「包络线:让客户选择、多段阶梯与安全进位」,《买手定价、费率阶跃与配件加购》给出的定量结论是什么?
结论:第二章说明汇款折扣在阈值处每笔只值 7.4,简单进位越过阶梯会把利润率压到 0.1742。
数据口径:书中的客户、价格、抽成、运费、退税率与汇率波动率均为示意模型;全部计算由书中程序生成;本书不是财务、税务、海关、法律或投资建议,不描述任何特定金流服务的条款。 第八章把这些合成一年的经营与一份检验方案。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 7.4
| fee 0.028, extra bank cost 210, hassle uniform on [0, 800] | ||||
| price | fee saved | best discount | take-up | gain/order |
| 13000 | 364 | 77 | 0.096 | 7.4 |
| 16000 | 448 | 119 | 0.149 | 17.7 |
| 20000 | 560 | 175 | 0.219 | 38.3 |
| 30000 | 840 | 315 | 0.394 | 124.0 |
| 50000 | 1400 | 595 | 0.744 | 442.5 |
| top-up across T: basket b, accessory a, extra net vs card | ||||
| basket | accessory | new total | discount | extra net |
| 12000 | 1000 | 13000 | 77 | 499 |
| 12400 | 700 | 13100 | 78 | 374 |
| 12400 | 1000 | 13400 | 83 | 505 |
| 12800 | 700 | 13500 | 84 | 379 |
| 12800 | 1500 | 14300 | 95 | 728 |
查看完整验算程序
# Chapter 2. p03: Let the customer choose the route. Above T the card is
# still accepted, but a bank transfer earns a discount d. A customer's
# hassle cost of a transfer is uniform on [0, K]; she transfers when
# d > k. The shop gains g P - dS - d per switch, where dS = S2 - S1, so
# the best discount is d* = (g P - dS) / 2 and the gain per order is
# (g P - dS)^2 / (4 K). Second panel: a basket b just under T plus one
# accessory of price a (margin 0.45, no extra freight) crosses T and
# can be paid by transfer at discount d*. No sampling.
T, G, DS, K, MU = 13000.0, 0.028, 210.0, 800.0, 0.45
def best(p):
s = G * p - DS
if s <= 0:
return 0.0, 0.0, 0.0
d = min(s / 2, K)
return d, d / K, d / K * (s - d)
if __name__ == "__main__":
print(" fee 0.028, extra bank cost 210, hassle uniform on [0, 800]")
print(" price fee saved best discount take-up gain/order")
for p in (13000, 16000, 20000, 30000, 50000):
d, u, gain = best(p)
print(" {:5d} {:9.0f} {:13.0f} {:7.3f} {:10.1f}".format(
p, G * p, d, u, gain))
print(" top-up across T: basket b, accessory a, extra net vs card")
print(" basket accessory new total discount extra net")
for b, a in ((12000, 1000), (12400, 700), (12400, 1000),
(12800, 700), (12800, 1500)):
tot = b + a
d, _, _ = best(tot)
card = b * (1 - G)
bank = tot - d - DS - a * (1 - MU)
print(" {:6d} {:9d} {:9d} {:8.0f} {:9.0f}".format(
b, a, tot, d, bank - card))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《跨境买手动态定价、阶跃费率支付路由与配件连带加购经济学》第 2 章「包络线:让客户选择、多段阶梯与安全进位」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-110 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026110,
author = {Fan, Yafu},
title = {Cross-Border Buyer Dynamic Pricing, Fee-Threshold Payment Routing and Accessory Attach Economics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}