What does Objection Judo and Deposit Locks conclude, in numbers, about “A Bayesian Decomposition of "Too Expensive": Budget, Value, Rival Quotes and Polite Refusal”?

Answer: Chapter 2 takes the objection apart on a simulated population: at the market price an unclear value accounts for 0.570 and lack of budget for only 0.136; one honest walk-through dissolves 0.334 of objections against 0.241 for a ten per cent cut, and a reflexive cut earns 0.391 less margin than asking first; a twelve-instalment plan with a low-looking monthly fee carries a nominal annual rate of 0.1303.

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: 0.136, 0.241, 0.334, 0.570

priceP(obj)budget valuecompare declinewalkcut10overlap
0.900.4570.1140.6120.0760.1970.4650.2430.087
1.000.6020.1360.5700.1440.1500.3340.2410.193
1.100.7220.1620.5460.1670.1250.2290.1860.312
1.250.8170.2170.5380.1350.1100.1510.0890.434
margin per sale at 1.00: full 0.45, after 10% cut 0.35
sales a cut must add to keep margin: 1.286 times
Show the full program
# Chapter 2. p21: Which constraint makes a customer say "too expensive"?
# A fixed-seed Monte Carlo of 60,000 synthetic enquiries per price.
# Each customer has a budget B, a true value T, a first-impression value
# V0 (biased low: the offer is not yet understood), a value V1 after an
# honest walk-through, maybe a rival quote R, and may simply not be
# interested (then price is a polite excuse with probability 0.6).
# All distributions are illustrative; price 1.00 = the market price.
# Attribution order: decline, then budget (hard), then value, then quote.
import math
import random

N = 60000
COST = 0.55


def draw(rng):
    t = 1.50 * math.exp(rng.gauss(0.0, 0.30))
    return {
        "B": 1.80 * math.exp(rng.gauss(0.0, 0.45)),
        "V0": t * math.exp(rng.gauss(-0.35, 0.30)),
        "V1": t * math.exp(rng.gauss(-0.05, 0.12)),
        "R": (math.exp(rng.gauss(-0.05, 0.12))
              if rng.random() < 0.5 else None),
        "out": rng.random() < 0.15,
        "excuse": rng.random() < 0.6,
    }


def binds(c, p, v):
    return {"budget": p > c["B"], "value": p > c[v],
            "compare": c["R"] is not None and p > 1.08 * c["R"]}


rng = random.Random(20261112)
PEOPLE = [draw(rng) for _ in range(N)]
print("price  P(obj)  budget value  compare decline  walk  cut10  overlap")
for price in (0.90, 1.00, 1.10, 1.25):
    tally = {"budget": 0, "value": 0, "compare": 0, "decline": 0}
    walk = cut = multi = objs = 0
    for c in PEOPLE:
        if c["out"]:
            if c["excuse"]:
                objs += 1
                tally["decline"] += 1
            continue
        b = binds(c, price, "V0")
        if not any(b.values()):
            continue
        objs += 1
        if len([k for k in b if b[k]]) > 1:
            multi += 1
        first = [k for k in ("budget", "value", "compare") if b[k]][0]
        tally[first] += 1
        if not any(binds(c, price, "V1").values()):
            walk += 1
        if not any(binds(c, 0.9 * price, "V0").values()):
            cut += 1
    share = [tally[k] / objs for k in ("budget", "value", "compare",
                                       "decline")]
    print("{:>5.2f} {:>7.3f} ".format(price, objs / N)
          + "".join("{:>7.3f}".format(s) for s in share)
          + " {:>6.3f} {:>6.3f} {:>8.3f}".format(walk / objs, cut / objs,
                                                 multi / objs))
m_full = 1.00 - COST
m_cut = 0.90 - COST
print("margin per sale at 1.00: full {:.2f}, after 10% cut {:.2f}".format(
    m_full, m_cut))
print("sales a cut must add to keep margin: {:.3f} times".format(
    m_full / m_cut))

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 2: A Bayesian Decomposition of "Too Expensive": Budget, Value, Rival Quotes and Polite Refusal. 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