What does Objection Judo and Deposit Locks conclude, in numbers, about “Three Faces of a Deposit: Loss Aversion, Screening and the Civil Code”?

Answer: Chapter 5 computes the three faces of a deposit: a forfeitable deposit borrows a grip of about 2.5131 times its amount, and the Chinese Civil Code sets a deposit cap and a penalty rule; the book's protocol refunds in full without reason for seven days.

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: 2.5131

loss multiplier L^(1/a)2.5131
deposit share felt loss saving needed to switch
forfeitable refundable
2000.020 -238.3 503 20
5000.050 -533.7 1,257 20
1,0000.100 -982.2 2,513 20
2,0000.200 -1807.5 5,026 20
same 500 framed as gain 237.2 or as loss -533.7
loss frame weighs 2.250 times the gain frame
deposit 2,000 then balance 8,000-7929.7; one 10,000: -7450.5
Show the full program
# Chapter 5. p51: How much "lock" does a deposit borrow from loss
# aversion? Value function v(x) = x^a for gains, -L * (-x)^a for losses,
# with a = 0.88 and L = 2.25 (median estimates of Tversky and Kahneman
# 1992). A customer who has paid a forfeitable deposit d must realise a
# loss of d to switch; the saving s she needs elsewhere satisfies
# s^a = L * d^a, so s = L^(1/a) * d. A refundable deposit costs her only
# the hassle of asking for it back (illustrative: 20). Price 10,000.
import math

A, L, PRICE, HASSLE = 0.88, 2.25, 10000.0, 20.0


def v(x):
    return x ** A if x >= 0 else -L * (-x) ** A


k = L ** (1.0 / A)
print("loss multiplier L^(1/a) = {:.4f}".format(k))
print("deposit  share   felt loss  saving needed to switch")
print("                            forfeitable  refundable")
for d in (200.0, 500.0, 1000.0, 2000.0):
    print("{:>7,.0f} {:>6.3f} {:>10.1f} {:>12,.0f} {:>11,.0f}".format(
        d, d / PRICE, v(-d), k * d, HASSLE))
# framing of the same 500 price difference
g, lo = v(500.0), v(-500.0)
print("same 500 framed as gain {:.1f} or as loss {:.1f}".format(g, lo))
print("loss frame weighs {:.3f} times the gain frame".format(-lo / g))
# two separate losses feel worse than one merged loss (convexity)
print("deposit 2,000 then balance 8,000: {:.1f}; one 10,000: {:.1f}"
      .format(math.fsum([v(-2000.0), v(-8000.0)]), v(-PRICE)))

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 5: Three Faces of a Deposit: Loss Aversion, Screening and the Civil Code. 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