What does Objection Judo and Deposit Locks conclude, in numbers, about “"Let Me Think": the Posterior of Silence and Choice Conflict”?

Answer: Chapter 3 reads silence: seven days after "let me think" the chance of a return within the next week is only 0.091, and going from two plans to six lowers the chance of a sale from 0.635 to 0.492.

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.492, 0.635

nP(buy)P(defer)of which conflict
10.5790.4210.000
20.6350.3650.187
30.6000.4000.326
40.5530.4470.415
50.5200.4800.467
60.4920.5080.502
most sales at n = 2; n = 6 keeps 0.774 of that
six plans, adviser shows two: P(buy) = 0.626
Show the full program
# Chapter 3. p32: More options, more "let me think": a conflict model of
# deferral in the spirit of Tversky and Shafir (1992) and Dhar (1997).
# A customer sees n plans whose utilities are independent N(0, 1). She
# buys the best plan if it beats her reservation level U0 and leads the
# runner-up by at least DELTA; otherwise she defers. Parameters are
# illustrative. A needs-led adviser shortlists two of six plans from
# the customer's stated needs, with estimation error.
# Fixed-seed Monte Carlo, 100,000 customers per row.
import random

U0, DELTA, N = -0.20, 0.50, 100000
rng = random.Random(20261112)

print(" n   P(buy)  P(defer)  of which conflict")
rows = {}
for n in range(1, 7):
    buy = defer = conflict = 0
    for _ in range(N):
        u = sorted((rng.gauss(0.0, 1.0) for _ in range(n)), reverse=True)
        if u[0] < U0:
            defer += 1
        elif n > 1 and u[0] - u[1] < DELTA:
            defer += 1
            conflict += 1
        else:
            buy += 1
    rows[n] = buy / N
    print("{:>2} {:>8.3f} {:>9.3f} {:>12.3f}".format(
        n, buy / N, defer / N, conflict / N))
best = max(rows, key=lambda k: rows[k])
print("most sales at n = {}; n = 6 keeps {:.3f} of that".format(
    best, rows[6] / rows[best]))
# needs-led: the adviser ranks six plans by what the customer said she
# needs, an estimate with error N(0, 0.7), and shows only the top two
buy = 0
for _ in range(N):
    u = [rng.gauss(0.0, 1.0) for _ in range(6)]
    e = [x + rng.gauss(0.0, 0.7) for x in u]
    top = sorted(range(6), key=lambda i: e[i], reverse=True)[:2]
    a, b = sorted((u[i] for i in top), reverse=True)
    if a >= U0 and a - b >= DELTA:
        buy += 1
print("six plans, adviser shows two: P(buy) = {:.3f}".format(buy / N))

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 3: "Let Me Think": the Posterior of Silence and Choice Conflict. 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