关于「秘书问题的三成七规则为什么在这里失效」,《远期承诺期权与对等停时》给出的定量结论是什么?

结论:秘书问题的三成七规则依赖六条假设,本书的局面几乎每条都不满足。改成连续收益、加入观察成本、允许回头或引入趋势后,最优放过比例从 0.05 到 0.60 不等。更合适的替代是由观察成本决定的保留阈值:成本越高,门槛越低,停得越早。

数据口径:书中参数为示意;全部计算由书中程序生成;本书不是心理咨询、婚恋咨询或临床判断,也不做任何命理推导。 书中以标注框区分证据、可运行计算(21 段程序)、原典与作者假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.05, 0.60

casebest ksharepayoffpayoff at k=7loss
classic-like40.200.8010.7670.034
cost 0.0120.100.7150.6200.095
cost 0.0310.050.5830.3270.256
recall q=0.550.250.8510.8470.004
declining pool10.050.5750.2130.362
rising pool120.601.1341.0730.061
查看完整验算程序
# Chapter 5. p52: the 37 percent cutoff once its assumptions break
# n = 20 options seen one by one, value U(0, 1) plus a trend. Payoff =
# value of the option kept minus c per option inspected (cardinal, not
# best-only). After passing the first k, take the first best-so-far;
# if none comes, recall the best passed option with probability q
# (it may have moved on), else keep the last one. Common random draws
# for every k; the best k is compared with the 1/e cutoff k = 7.
import math
import random

N, SIMS = 20, 4000
rng = random.Random(42352)
base = [[rng.random() for _ in range(N)] for _ in range(SIMS)]
gate = [rng.random() for _ in range(SIMS)]


def run(k, c, q, trend):
    tot = []
    for s in range(SIMS):
        row = [base[s][i] + trend * i / (N - 1) for i in range(N)]
        best = max(row[:k]) if k > 0 else -1.0e9
        pick, seen = None, N
        for i in range(k, N):
            if row[i] > best:
                pick, seen = row[i], i + 1
                break
        if pick is None:
            pick = best if (k > 0 and gate[s] < q) else row[N - 1]
        tot.append(pick - c * seen)
    return math.fsum(tot) / SIMS


CASES = [("classic-like", 0.00, 0.0, 0.0),
         ("cost 0.01", 0.01, 0.0, 0.0),
         ("cost 0.03", 0.03, 0.0, 0.0),
         ("recall q=0.5", 0.00, 0.5, 0.0),
         ("declining pool", 0.00, 0.0, -0.4),
         ("rising pool", 0.00, 0.0, 0.4)]
print("case              best k  share  payoff   payoff at k=7  loss")
for name, c, q, tr in CASES:
    vals = [run(k, c, q, tr) for k in range(N)]
    k_best = max(range(N), key=lambda k: vals[k])
    print("{:16s} {:7d} {:6.2f} {:8.3f} {:14.3f} {:6.3f}".format(
        name, k_best, k_best / N, vals[k_best], vals[7],
        vals[k_best] - vals[7]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《亲职基因优选与排他恋爱解耦、远期空头期权钩子与对等底线停时母典》第 5 章「秘书问题的三成七规则为什么在这里失效」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-423 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026423,
  author    = {Fan, Yafu},
  title     = {Unbundling Paternal Selection from Romantic Commitment: Deferred-Promise Options, Avoidant Autonomy and Reciprocal Stopping Rules},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论