What does Bayesian Search and Optimal Stopping conclude, in numbers, about “Sunk Costs: Rational Persistence, Fallacious Persistence and Stop-Loss Boundaries Set in Advance”?
Answer: The sunk-cost effect is robust in hypothetical scenarios, with a pooled meta-analytic effect size of about 0.5, but in laboratory experiments with real incentives it is small and erratic (surveys and field studies of project decisions show larger effects), and it is often entangled with closeness to completion and personal responsibility. In the normative model, money already spent does not enter the decision; the evidence accumulated and the remaining value of information do, so that continuing below break-even early on can be rational. With illustrative parameters, myopic early quitting loses about 29 %, while adding to the optimal rule the sunk-cost tendency "never quit after 10 trials" loses about 6 %. Wald's sequential probability ratio test gives stop-loss and go-ahead boundaries that can be written down in advance and needs on average only half to six-tenths of a fixed sample at the two hypotheses, but it can run long when the true value lies between them, so a cap must be set. The next chapter applies these tools to start-up experiments and to the selection of people.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (17 programs, all checked), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 10
| optimal: continue before trial t + 1 iff successes >= s_min | |
| trials done t s_min posterior mean at s_min myopic break-even | |
| 0 | 0 0.333 0.300 |
| 5 | 1 0.250 0.300 |
| 10 | 2 0.231 0.300 |
| 20 | 5 0.261 0.300 |
| 30 | 9 0.303 0.300 |
| 35 | 10 0.289 0.300 |
| 39 | 12 0.310 0.300 |
| expected value under the prior Beta(1, 2) | |
| optimal (forward-looking) | 37.881 |
| never abandon | 13.333 |
| myopic: continue iff m > | 0.3 26.896 |
| optimal, but never quit after 10 trials | 35.552 |
| optimal, but never quit after 20 trials | 37.599 |
| myopic, and never quit after 10 trials | 26.822 |
| prior Beta(1, 3), mean 0.25: myopic never starts (0.000); optimal 15.358 |
Key formula
Show the full program
# Continue or abandon (illustrative numbers). Up to T = 40 trials; each costs c = 3 and
# succeeds with unknown p, earning R = 10; prior Beta(1, 2); break-even p = 0.3. After any
# trial one may abandon (0 from then on). Money already spent, 3 (s + f), appears nowhere:
# V(s, f) = max(0, m R - c + m V(s+1, f) + (1-m) V(s, f+1)), m = (a+s)/(a+b+s+f).
# A rule(t, s, m) -> continue? is evaluated exactly by the same recursion.
T, C, R = 40, 3.0, 10.0
def solve(rule=None, a=1, b=2):
nxt, keep = [0.0] * (T + 1), {}
for t in range(T - 1, -1, -1):
cur = []
for s in range(t + 1):
m = (a + s) / (a + b + t)
go = m * R - C + m * nxt[s + 1] + (1 - m) * nxt[s]
if go > 0 and t not in keep:
keep[t] = (s, m) # fewest successes to continue
cur.append(max(0.0, go) if rule is None else go if rule(t, s, m) else 0.0)
nxt = cur
return nxt[0], keep
if __name__ == "__main__":
best, keep = solve()
print("optimal: continue before trial t + 1 iff successes >= s_min")
print(" trials done t s_min posterior mean at s_min myopic break-even")
for t in (0, 5, 10, 20, 30, 35, 39):
print(f" {t:8d} {keep[t][0]:3d} {keep[t][1]:.3f}"
" 0.300")
opt = lambda t, s: s >= keep[t][0]
rules = (("never abandon", lambda t, s, m: True),
("myopic: continue iff m >= 0.3", lambda t, s, m: m >= 0.3),
("optimal, but never quit after 10 trials",
lambda t, s, m: opt(t, s) or t >= 10),
("optimal, but never quit after 20 trials",
lambda t, s, m: opt(t, s) or t >= 20),
("myopic, and never quit after 10 trials",
lambda t, s, m: m >= 0.3 or t >= 10))
print("expected value under the prior Beta(1, 2)")
print(f" {'optimal (forward-looking)':42s} {best:7.3f}")
for name, rule in rules:
print(f" {name:42s} {solve(rule)[0]:7.3f}")
print(f"prior Beta(1, 3), mean 0.25: myopic never starts (0.000);"
f" optimal {solve(None, 1, 3)[0]:.3f}")Single source and citation
Fan, Y. (2026). Bayesian Search in Unknown Landscapes, Optimal Stopping and Gittins Indices (Version 1.0.0), Chapter 5: Sunk Costs: Rational Persistence, Fallacious Persistence and Stop-Loss Boundaries Set in Advance. 5D Library. https://doi.org/10.5281/zenodo.23810102
DOI: 10.5281/zenodo.23810102 · Read the monograph · 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}
}Other chapter answers in this book
- Chapter 1 · The Secretary Problem and 1/e: When to Stop If You See Only Ranks and Cannot Go Back
- Chapter 2 · Variants of the Secretary Problem and How People Stop
- Chapter 3 · Bayesian Search: Where to Look, and What Not Finding Means
- Chapter 4 · Multi-Armed Bandits: Gittins Indices, Thompson Sampling and the Regret Lower Bound
- Chapter 6 · Applications: Testing Lanes and Selecting People
- Chapter 8 · Practice and a Pre-Registered Trial