What does Retrodiction and Upsell Automata conclude, in numbers, about “The Commitment Ratchet: Price Ratios and Upsell Timing”?
Answer: Chapter 3 finds the best upsell price ratio under a resistance threshold and sunk cost (1.99 at a first purchase, 1.86 with refunds) and the best timing (an offer on day 7 earns several times one made the next day).
Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.
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: 1.86, 1.99
sunk S/p threshold no refunds: r* A(r*) with refunds: r* A(r*) phi
0 2.500 1.99 0.701 1.86 0.744 0.127
1 3.055 2.40 0.749 2.26 0.790 0.113
3 3.609 2.82 0.788 2.68 0.825 0.103
10 4.418 3.48 0.827 3.33 0.860 0.092
Reading: sunk cost raises the jump a buyer tolerates, so the
best ratio grows along the ladder. The optimum always lies
well below the resistance threshold, and counting refunds
lowers it further: pushing to the threshold does not pay.Key formula
Show the full program
# Chapter 3. [p05] The optimal price jump for one upsell, with and
# without the cost of regret. A buyer of tier i (price p) is offered
# tier i+1 at r * p. She accepts with logistic probability
# A(r) = 1 / (1 + exp((r - r0) / 0.6)),
# where her resistance threshold r0 = 2.5 + 0.8 * ln(1 + S / p) rises
# with what she has already spent, S (sunk cost; S = 0 for a first
# purchase). A share of buyers who accept ask for a refund, more so
# the harder they were pushed: phi(r) = 0.05 + 0.30 / (1 + exp(-(r -
# r0) / 0.6)). Net revenue per offer, in units of p: r A(r) (1 - phi).
import math
def r0(sunk):
return 2.5 + 0.8 * math.log(1 + sunk)
def accept(r, t):
return 1 / (1 + math.exp((r - t) / 0.6))
def refund(r, t):
return 0.05 + 0.30 / (1 + math.exp(-(r - t) / 0.6))
def best(sunk, with_refunds):
t = r0(sunk)
grid = [1 + k / 100 for k in range(0, 1201)]
def net(r):
return r * accept(r, t) * ((1 - refund(r, t)) if with_refunds
else 1.0)
r = max(grid, key=net)
return t, r, accept(r, t), refund(r, t), net(r)
if __name__ == "__main__":
print(" sunk S/p threshold no refunds: r* A(r*) with refunds:"
" r* A(r*) phi")
for sunk in (0, 1, 3, 10):
t, r1, a1, f1, n1 = best(sunk, False)
t, r2, a2, f2, n2 = best(sunk, True)
print(" {:7d} {:10.3f} {:16.2f} {:6.3f} {:17.2f} {:6.3f} {:5.3f}"
.format(sunk, t, r1, a1, r2, a2, f2))
print("\nReading: sunk cost raises the jump a buyer tolerates, so the")
print("best ratio grows along the ladder. The optimum always lies")
print("well below the resistance threshold, and counting refunds")
print("lowers it further: pushing to the threshold does not pay.")Single source and citation
Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata (Version 1.0.0), Chapter 3: The Commitment Ratchet: Price Ratios and Upsell Timing. 5D Library. https://doi.org/10.5281/zenodo.24090186
DOI: 10.5281/zenodo.24090186 · Read the monograph · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026069,
author = {Fan, Yafu},
title = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090186},
url = {https://doi.org/10.5281/zenodo.24090186}
}Other chapter answers in this book
- Chapter 1 · Retrodictive Statements and the "Trust Avalanche"
- Chapter 2 · Testing Retrodiction Fairly: Sequential Tests and Selective Recall
- Chapter 4 · What Pain-Point Agitation Buys and Costs, and Two Guardrails
- Chapter 5 · The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence
- Chapter 6 · Cross-Module Transition Matrices: Estimation, Cannibalization and Heterogeneity
- Chapter 7 · "Probing" and "Flying and Clamping" in the *Guiguzi*, "The Difficulties of Persuasion" in the *Han Feizi*
- Chapter 8 · A Calculator for the User and a Pre-Registered Blinded Test