关于「应用:赛道测试与人才筛选」,《贝叶斯搜索与最优停止》给出的定量结论是什么?
结论:赛道测试中,「边学边赚」与「先学后赚」是两个不同的目标:汤普森抽样在测试期间得到最多的转化,前二汤普森抽样把更多试验留给挑战者以提高选对的概率,逐轮淘汰是一种不需要概率计算的提前停止;在示意的参数下,选对概率的差别在模拟误差之内,转化数的差别更清楚。真实应用中需要注意结果延迟、指标选择与赢家的诅咒。人才筛选中,报酬是实际水平时最好的阈值约为 \(\sqrt{n}\),40 人时只需跳过 5 人;看得到水平、知道分布并且面试有成本时,最优规则往往在最初几个人中就录用。下一章把这些想法与几段中国古代文献并读。
数据口径:本书是教学与研究用的数学模型,不是投资、创业、职业或人力资源建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(17 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 40
| (a) cardinal payoff, relative ranks only: expected quality of the hire | |
| n best c sqrt(n) E at best c | 1/e cutoff c E at 1/e cutoff |
| 10 | 3 3.2 0.7333 5 0.7000 |
| 40 | 6 6.3 0.8542 16 0.7812 |
| 100 | 10 10.0 0.9050 38 0.8018 |
| 400 | 20 20.0 0.9513 148 0.8129 |
| (b) interview cost k, quality seen, n | 40: net value (interviews used) |
| k first reservation reservation rule | 1/e rank rule |
| 0.000 | 0.955 0.955 (15.0) 0.781 (30.0) |
| 0.005 | 0.898 0.898 ( 9.2) 0.628 (30.0) |
| 0.020 | 0.800 0.800 ( 5.0) 0.179 (30.1) |
查看完整验算程序
# (a) Cardinal payoff (Bearden 2006): quality ~ U(0, 1), relative ranks only, payoff =
# quality hired; cutoff c, last applicant if nobody qualifies; exact formula.
# (b) Quality seen, distribution known, cost k per interview: reservation levels by
# backward induction, against the 1/e rank rule (20,000 simulated runs).
import math, random
def cardinal(n, c):
if c == 1:
return 0.5
return (c - 1) * sum(1 / ((i - 1) * (i + 1)) for i in range(c, n + 1)) \
+ (c - 1) / (2 * (n + 1))
def reservation(n, k):
w = [0.0] # w[j]: value with j interviews left
for j in range(1, n + 1):
prev = w[-1]
emax = (1 + prev ** 2) / 2 if prev > 0 else 0.5
w.append(max(0.0, emax - k))
return w
def sim(n, k, rule, rng, runs=20000):
w, val, cnt = reservation(n, k), 0.0, 0
r = round(n / math.e) + 1
for _ in range(runs):
xs = [rng.random() for _ in range(n)]
if rule == "reservation":
for i, x in enumerate(xs):
if w[n - i] <= 0:
i, x = i - 1, 0.0
break
if x >= w[n - 1 - i]:
break
else:
bar = max(xs[:r - 1])
i = next((j for j in range(r - 1, n) if xs[j] > bar), n - 1); x = xs[i]
val += x - k * (i + 1); cnt += i + 1
return val / runs, cnt / runs
if __name__ == "__main__":
print("(a) cardinal payoff, relative ranks only: expected quality of the hire")
print(" n best c sqrt(n) E at best c 1/e cutoff c E at 1/e cutoff")
for n in (10, 40, 100, 400):
c = max(range(1, n + 1), key=lambda c: cardinal(n, c))
r = round(n / math.e) + 1
print(f" {n:4d} {c:5d} {math.sqrt(n):5.1f} {cardinal(n, c):.4f}"
f" {r:4d} {cardinal(n, r):.4f}")
print("(b) interview cost k, quality seen, n = 40: net value (interviews used)")
print(" k first reservation reservation rule 1/e rank rule")
rng = random.Random(2006)
for k in (0.0, 0.005, 0.02):
w = reservation(40, k)
a = sim(40, k, "reservation", rng); b = sim(40, k, "1/e", rng)
print(f" {k:6.3f} {w[39]:.3f} {a[0]:.3f} ({a[1]:4.1f})"
f" {b[0]:.3f} ({b[1]:4.1f})")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《未知地形中的贝叶斯搜索、秘书问题与吉廷斯指数》第 6 章「应用:赛道测试与人才筛选」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23810102
DOI: 10.5281/zenodo.23810102 · 阅读本章所在专著 · 5DL-B-042 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026042,
author = {Fan, Yafu},
title = {Bayesian Search in Unknown Landscapes, Optimal Stopping and Gittins Indices},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23810102},
url = {https://doi.org/10.5281/zenodo.23810102}
}