What does Computing the Rhythm of Private-Message Sales conclude, in numbers, about “Placed but Not Paid: Present Bias, Gentle Reminder Pulses and a Year's Account of a Threatening Tone”?
Answer: Chapter 6 enumerates every reminder schedule within 72 hours: two gentle reminders bring the probability of payment to 0.581, a third does not pay its way, and a threatening tone loses 47,736 over a year.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not individual legal, compliance or business advice, and it discusses only closing that keeps the rules. Chapter 1 splits an illustrative 184-character quote by dynamic programming into 5 bubbles at a cost of 46.52, against 142.00 for one sentence per bubble.
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.581
| reminders | best hours after order | clock times | P(pay) | net |
|---|---|---|---|---|
| 0 | [] | - | 0.372 | 0.372 |
| 1 | [13] | 09 | 0.492 | 0.480 |
| 2 | [13, 61] | 09,09 | 0.581 | 0.539 |
| 3 | [13, 38, 63] | 09,10,11 | 0.627 | 0.512 |
| marginal net of each added reminder: +0.108, +0.059, -0.027 | ||||
| three crammed into one morning [13, 14, 15]: P(pay) 0.504, net 0.388 |
Show the full program
# Chapter 6. p62: timing gentle payment reminders inside a 72-hour window
# Model (illustrative parameters): an order is placed at 20:00 and left
# unpaid. The hourly payment hazard is H0 * exp(-t / 24) and each reminder
# sent at hour s adds b * exp(-(t - s) / TAU) for t >= s, where b =
# BOOST for the first one and BOOST * (1 - exp(-gap / HAB)) for a later
# one sent gap hours after the previous (habituation). The k-th reminder
# triggers a complaint or block with probability ANNOY[k - 1]. Value:
# paid order = 1, complaint = -W. Reminders may only go out from 09:00
# to 20:59 local time. All schedules of up to three are enumerated.
import itertools
import math
H0, BOOST, TAU, START = 0.02, 0.06, 3.0, 20
ANNOY, W, HAB, HORIZON = (0.004, 0.010, 0.025), 3.0, 18.0, 72
def allowed(s):
clock = (START + s) % 24
return 9 <= clock < 21
def p_pay(sched):
hz = []
for t in range(HORIZON):
terms = [H0 * math.exp(-t / 24)]
for i, s in enumerate(sched):
b = BOOST
if i > 0:
b *= 1 - math.exp(-(s - sched[i - 1]) / HAB)
if t >= s:
terms.append(b * math.exp(-(t - s) / TAU))
hz.append(math.fsum(terms))
return 1 - math.exp(-math.fsum(hz))
def net(sched):
stay, comp = 1.0, []
for k in range(len(sched)):
comp.append(stay * ANNOY[k])
stay *= 1 - ANNOY[k]
c = math.fsum(comp)
return p_pay(sched) - W * c, c
slots = [s for s in range(1, HORIZON) if allowed(s)]
print("reminders best hours after order clock times P(pay) net")
results = []
for k in range(4):
best = None
for sched in itertools.combinations(slots, k):
v, c = net(sched)
if best is None or v > best[0]:
best = (v, sched, c)
v, sched, c = best
results.append(v)
clocks = ",".join("{:02d}".format((START + s) % 24) for s in sched)
print("{:>9} {:>23} {:>13} {:>10.3f} {:>6.3f}".format(
k, str(list(sched)), clocks or "-", p_pay(sched), v))
print("marginal net of each added reminder: " + ", ".join(
"{:+.3f}".format(b - a) for a, b in zip(results, results[1:])))
cram = (13, 14, 15)
v, c = net(cram)
print("three crammed into one morning {}: P(pay) {:.3f}, net {:.3f}".format(
list(cram), p_pay(cram), v))Single source and citation
Fan, Y. (2026). Instant-Messaging Bubble Rhythm, Read-No-Reply Icebreaking Games and High-Ticket Closing in Private Messages (Version 1.0.0), Chapter 6: Placed but Not Paid: Present Bias, Gentle Reminder Pulses and a Year's Account of a Threatening Tone. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-145 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026145,
author = {Fan, Yafu},
title = {Instant-Messaging Bubble Rhythm, Read-No-Reply Icebreaking Games and High-Ticket Closing in Private Messages},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Bubble Splitting: Working-Memory Capacity, Interruption Cost and the Optimal Length of a Private Message by Dynamic Programming
- Chapter 2 · First-Reply Latency: the Cooling Curve of an Inquiry, Night-Time Auto-Acknowledgements and Erlang C Staffing
- Chapter 3 · Read but No Reply: Bayesian Updating on Receipts, the Timing of an Icebreaker and a Game of Commitment
- Chapter 4 · Laying the Ground for a Two-Track Quote: Mixed Logit, the Compromise Effect and Anchoring on the Higher Track
- Chapter 5 · Closing a High-Ticket Sale: Refundable Deposits, Default Options and the Threshold for Handing Over to a Human
- Chapter 7 · The Classics Examined: the Chapter on Assessing Feelings in the Guiguzi and Bacon's Of Negotiating
- Chapter 8 · Practice and Refutation: a Closing Skill Pack for Customer Service, a Rule Replay and Pre-Registered Tests