关于「最优停时:秘书问题的 1/e、已知尺度下的阈值与对等底线规则」,《真心的信号与时冷时热的陷阱》给出的定量结论是什么?

结论:第五章说明秘书问题的极限成功率只有 0.3679,并提出对等底线:比值连续 3 周低于 0.5 即退出,示意模型中一年内误伤真投入者的概率为 0.0258,识别投入不足者平均需要 6.99 周。

数据口径:书中参数均为示意值;全部计算由书中程序生成;本书不是心理咨询,不宣称任何效果,也不教授任何操控手段。 第二章把每次互动记入似然比账本,示意参数下一次失约的分量相当于 2.52 次兑现,沃尔德序贯检验平均比固定观察期节省 0.459 的互动。

English version

对照数据表

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

rhomq genuineq exploitfalse exit/52 wkweeks to exit
0.320.00800.28250.003316.07
0.330.00800.28250.000060.41
0.340.00800.28250.0000217.37
0.520.08280.67230.27863.70
0.530.08280.67230.02586.99
0.540.08280.67230.002111.89
0.720.23780.86850.91712.48
0.730.23780.86850.41414.00
0.740.23780.86850.11445.76
default rule: rho = 0.5, m = 3
查看完整验算程序
# Chapter 5. p53: the reciprocal floor as a stopping rule. Each week the
# ratio r = (what the other puts in)/(what you put in) is logged. Rule:
# leave when r < rho for m weeks in a row. Illustrative model: ln r is
# normal with sd 0.5, mean ln 1 for a genuine partner and ln 0.4 for an
# exploitative one. q = P(r < rho). Exact: false-exit probability within
# 52 weeks for the genuine partner (run-length Markov chain) and mean
# weeks to exit for the exploitative one, (1 - q^m)/((1 - q) q^m).
import math

SD, WEEKS = 0.5, 52


def phi(z):
    return 0.5 * (1 + math.erf(z / math.sqrt(2)))


def q_below(rho, mu):
    return phi((math.log(rho) - math.log(mu)) / SD)


def false_exit(q, m, weeks):
    state = [1.0] + [0.0] * (m - 1)      # current run length 0..m-1
    gone = 0.0
    for _ in range(weeks):
        new = [0.0] * m
        new[0] = (1 - q) * math.fsum(state)
        for k in range(m - 1):
            new[k + 1] = q * state[k]
        gone += q * state[m - 1]
        state = new
    return gone


print(" rho  m   q genuine  q exploit  false exit/52 wk  weeks to exit")
for rho in (0.3, 0.5, 0.7):
    qg, qo = q_below(rho, 1.0), q_below(rho, 0.4)
    for m in (2, 3, 4):
        wait = (1 - qo ** m) / ((1 - qo) * qo ** m)
        print("{:4.1f}  {}   {:9.4f}  {:9.4f}  {:16.4f}  {:13.2f}".format(
            rho, m, qg, qo, false_exit(qg, m, WEEKS), wait))
print("default rule: rho = 0.5, m = 3")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《亲密关系早期高代价信号甄别、间歇性强化多巴胺成瘾陷阱与对等底线停时博弈》第 5 章「最优停时:秘书问题的 1/e、已知尺度下的阈值与对等底线规则」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026181,
  author    = {Fan, Yafu},
  title     = {Costly-Signal Screening in Early Intimacy, Intermittent-Reinforcement Dopamine Traps and Reciprocal-Floor Stopping Games},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论