What does Identity Labels and Self-Persuasion, Weighed conclude, in numbers, about “The Commitment Ladder: Foot-in-the-Door as an Absorbing Markov Chain, and the Refund Payback”?

Answer: Chapter 2 writes the foot-in-the-door technique as an absorbing Markov chain; the best ladder has two steps and converts 0.2258, and maximum closing pressure yields only 0.679 of the best net income.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not legal advice and not personalised financial or business advice. Marked boxes separate published evidence, runnable Python calculations (19 programs), 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. standard-library Python onlyprinted values that match the answer: 0.2258

kreachq_kconvertburdenleft early
01.00000.10000.10001.0000.0000
10.90000.20800.18721.9000.1000
20.74520.30300.22582.6450.2548
30.56770.38670.21953.2130.4323
40.39780.46030.18313.6110.6022
50.25650.52500.13473.8670.7435
60.15220.58200.08864.0190.8478
70.08300.63220.05254.1020.9170
80.04170.67630.02824.1440.9583
90.01930.71520.01384.1630.9807
best k = 2, conversion 0.2258 vs 0.1000 with no ladder
k = 8 converts 0.0282: 0.1248 of the best, burden 4.144
Show the full program
# Chapter 2. p21: The commitment ladder as an absorbing Markov chain.
# Model: before the large (high-ticket) request a reader is asked k
# small requests. Step i (0-based) is completed with probability
# s * (1 - f) ** i (fatigue f); a reader who declines leaves (absorbs).
# Each completed step raises acceptance of the large request through
# consistency: q_k = 1 - (1 - q0) * (1 - c) ** k. Expected number of
# requests a reader receives measures burden. Parameters illustrative.
import math

Q0, C, S, F = 0.10, 0.12, 0.90, 0.08


def chain(k):
    reach, asks, exits = 1.0, [], []
    for i in range(k):
        p = S * (1 - F) ** i
        asks.append(reach)          # reader is asked step i
        exits.append(reach * (1 - p))
        reach *= p
    q = 1 - (1 - Q0) * (1 - C) ** k
    burden = math.fsum(asks) + reach   # small asks plus the large one
    return reach, q, reach * q, burden, math.fsum(exits)


print(" k   reach    q_k     convert   burden   left early")
best = None
for k in range(0, 10):
    reach, q, conv, burden, ex = chain(k)
    print("{:2d}  {:6.4f}  {:6.4f}  {:8.4f}  {:7.3f}  {:10.4f}".format(
        k, reach, q, conv, burden, ex))
    if best is None or conv > best[1]:
        best = (k, conv)
k0 = chain(0)[2]
print("best k = {}, conversion {:.4f} vs {:.4f} with no ladder".format(
    best[0], best[1], k0))
r8 = chain(8)
print("k = 8 converts {:.4f}: {:.4f} of the best, burden {:.3f}".format(
    r8[2], r8[2] / best[1], r8[3]))

Single source and citation

Fan, Y. (2026). Self-Fulfilling Identity Labels, In-Group Belonging Calls and the Rhetoric of Resistance-Free High-Ticket Self-Persuasion (Version 1.0.0), Chapter 2: The Commitment Ladder: Foot-in-the-Door as an Absorbing Markov Chain, and the Refund Payback. 5D Library. DOI pending

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

BibTeX
@book{fan2026142,
  author    = {Fan, Yafu},
  title     = {Self-Fulfilling Identity Labels, In-Group Belonging Calls and the Rhetoric of Resistance-Free High-Ticket Self-Persuasion},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book