关于「反商业贿赂红线:礼与贿的分界」,《送礼无谓损失与企业节礼》给出的定量结论是什么?
结论:收礼人 R-A 每年收到两份价值 120 的礼物,任何时点上滚动累计都是 240,始终合规。收礼人 R-B 的情形不同:每份礼物只有 70,远低于单件上限,但在 2026 年里一共安排了六次。到第五次时,滚动累计达到 350,次数达到 5 次,两项同时超标,这次和紧随其后的一次都被拒绝。被拒绝的礼物没有送出,因此不计入累计;到次年一月,最早的几笔滑出窗口,新的礼物又可以通过。
数据口径:书中客户、礼品与参数均为示意;全部计算由书中程序生成;本书是非个人化的经营分析,不构成经营、法律、税务或理财建议,法条以上架前人工复核为准。 第五章推导盈亏平衡的年礼,同样的提升下忠诚客户值得 2.67 倍的礼,按价值分配的示意预算净收益为 356.63,平均分配只有 90.98。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 120, 2026, 240, 350, 70
| rolling 365-day cap 300, at most 4 occasions | ||||
| recipient R-A | ||||
| date | value | window total | count | check |
| 2026-01-20 | 120 | 120 | 1 | ok |
| 2026-09-15 | 120 | 240 | 2 | ok |
| 2027-01-28 | 120 | 240 | 2 | ok |
| 2027-09-20 | 120 | 240 | 2 | ok |
| recipient R-B | ||||
| date | value | window total | count | check |
| 2026-01-20 | 70 | 70 | 1 | ok |
| 2026-02-14 | 70 | 140 | 2 | ok |
| 2026-04-05 | 70 | 210 | 3 | ok |
| 2026-06-19 | 70 | 280 | 4 | ok |
| 2026-09-15 | 70 | 350 | 5 | value/count |
| 2026-10-01 | 70 | 350 | 5 | value/count |
| 2027-01-28 | 70 | 280 | 4 | ok |
| refused gifts are not given, so they do not enter the window |
查看完整验算程序
# Chapter 6. p62: splitting a gift does not split the ledger.
# Model: a firm caps what one recipient may receive in any rolling
# 365 days at YEARCAP = 300 and at 4 occasions. Each proposed gift is
# checked against everything given to that recipient in the 365 days
# up to and including its date. Dates and values are illustrative.
import datetime as dt
import math
YEARCAP = 300.0
MAXN = 4
LOG = {
"R-A": (("2026-01-20", 120.0), ("2026-09-15", 120.0),
("2027-01-28", 120.0), ("2027-09-20", 120.0)),
"R-B": (("2026-01-20", 70.0), ("2026-02-14", 70.0),
("2026-04-05", 70.0), ("2026-06-19", 70.0),
("2026-09-15", 70.0), ("2026-10-01", 70.0),
("2027-01-28", 70.0)),
}
def check(rows):
seen = []
out = []
for ds, v in rows:
d = dt.date.fromisoformat(ds)
window = [(d0, v0) for d0, v0 in seen
if (d - d0).days < 365] + [(d, v)]
total = math.fsum([v0 for _, v0 in window])
n = len(window)
flag = []
if total > YEARCAP:
flag.append("value")
if n > MAXN:
flag.append("count")
out.append((ds, v, total, n, "/".join(flag) or "ok"))
if not flag:
seen.append((d, v))
return out
if __name__ == "__main__":
print("rolling 365-day cap {:.0f}, at most {} occasions".format(
YEARCAP, MAXN))
for who, rows in LOG.items():
print("recipient " + who)
print(" date value window total count check")
for ds, v, tot, n, f in check(rows):
print(" {} {:5.0f} {:8.0f} {:>3d} {}".format(
ds, v, tot, n, f))
print("refused gifts are not given, so they do not enter the window")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《送礼无谓损失、人情账本互惠衰减与企业节礼信号价值母典》第 6 章「反商业贿赂红线:礼与贿的分界」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-223 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026223,
author = {Fan, Yafu},
title = {The Deadweight Loss of Gift-Giving, Reciprocity-Ledger Decay and the Signalling Value of Corporate Gifts},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}