What does Objection Judo and Deposit Locks conclude, in numbers, about “Stopping-Time Protocols: the Secretary Problem, Follow-up Caps and Lock Windows”?

Answer: Chapter 6 writes closing as a stopping problem: a single closing request succeeds with a probability approaching 0.3679, follow-ups are capped at two, and a three-day refundable lock window raises the final purchase probability from 0.225 to 0.488.

Scope of the numbers: Its customer populations, probabilities and amounts are illustrative; all calculations are generated by its programs; it is not individual legal, financial or investment advice, and it discusses only persuasion that keeps the rules. Chapter 1's objection tree shows that, under illustrative priors, 0.734 of those who say "too expensive" are not short of money.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.225, 0.488

lock TP(buy) P(switch) P(drift)P(no)holdmargin/lead
none0.2250.3820.2950.098 0.0000.1011
30.4880.3040.0000.208 0.0060.2137
70.2980.5740.0000.128 0.0140.1202
140.1290.8160.0000.056 0.0280.0298
P(no cheaper rival in T days) = (1 - 0.3 * p)^T, p = 0.3803
Show the full program
# Chapter 6. p63: A refundable deposit turns an open-ended "let me think"
# into a stopping time with a known horizon T. During T days the
# customer keeps searching: each day she meets a rival quote with
# probability 0.30, priced at our price times exp(N(0, 0.10)); she
# switches (and gets her deposit back) if it is cheaper by more than
# 0.03. With no lock she also drifts away with daily probability 0.10
# and decides on her own with daily probability 0.12. With a lock she
# decides on day T. A decision is yes with probability 0.70; a no with
# a lock is refunded in full. Holding a slot costs 0.002 a day.
# Fixed-seed Monte Carlo, 50,000 customers per row; illustrative.
import math
import random

N = 50000
rng = random.Random(20261112)


def no_lock():
    for _ in range(60):
        if rng.random() < 0.30 and math.exp(rng.gauss(0, 0.10)) < 0.97:
            return "switch"
        if rng.random() < 0.10:
            return "drift"
        if rng.random() < 0.12:
            return "buy" if rng.random() < 0.70 else "refuse"
    return "drift"


def lock(t):
    for _ in range(t):
        if rng.random() < 0.30 and math.exp(rng.gauss(0, 0.10)) < 0.97:
            return "switch"
    return "buy" if rng.random() < 0.70 else "refuse"


print("lock T  P(buy) P(switch) P(drift)  P(no)  hold  margin/lead")
rows = [("none", no_lock, 0)] + [(str(t), lambda t=t: lock(t), t)
                                 for t in (3, 7, 14)]
for name, fn, t in rows:
    out = {"buy": 0, "switch": 0, "drift": 0, "refuse": 0}
    for _ in range(N):
        out[fn()] += 1
    pb = out["buy"] / N
    hold = 0.002 * t
    print("{:>6} {:>7.3f} {:>9.3f} {:>8.3f} {:>6.3f} {:>5.3f} {:>12.4f}"
          .format(name, pb, out["switch"] / N, out["drift"] / N,
                  out["refuse"] / N, hold, pb * 0.45 - hold))
print("P(no cheaper rival in T days) = (1 - 0.3 * p)^T, p = {:.4f}".format(
    0.5 * math.erfc(math.log(1 / 0.97) / (0.10 * math.sqrt(2)))))

Single source and citation

Fan, Y. (2026). Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols (Version 1.0.0), Chapter 6: Stopping-Time Protocols: the Secretary Problem, Follow-up Caps and Lock Windows. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-146 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026146,
  author    = {Fan, Yafu},
  title     = {Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book