What does Red-Blue Synthetic-Customer Sandboxes conclude, in numbers, about “Parameterised Demanding Buyers: a Multi-Round Haggling Sandbox, Concession Ladders and the Margin Floor”?

Answer: Chapter 4 uses 240 parameterised demanding buyers to compare one price, a concession ladder and real tiers: the ladder hands an average discount of 0.0512 to buyers who would have paid in full, and while the average buyer passes right on the line, 0.4112 of the crowd's deals break the margin floor.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs, which call no model interface. This is not individual business advice.

中文版

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.4112, 240

average buyer: R 1.000, d 0.735 -> price 0.85 in 4 rounds
average buyer margin 0.30 vs floor 0.30: pass
crowd deals197 of 240
deals below the margin floor81 (0.4112 of deals)
margin per deal,5 th percentile: 0.25
margin per deal, 25 th percentile0.25
margin per deal, 50 th percentile0.35
Show the full program
# Chapter 4. p43: the average buyer passes the ladder; the crowd does
# not. Same buyers and LADDER script as p41 (cut 0.05, floor 0.80,
# cost 0.55). A margin floor of 0.30 per deal (price 0.85) is the
# owner's red line (illustrative). The average buyer takes the middle
# of every trait: R = 1.000, d = 0.735, h = 0.5. We report his single
# result and the crowd's margin distribution per deal.
import random

N, COST, FLOOR_M = 240, 0.55, 0.30


def crowd(rng):
    cols = []
    for _ in range(3):
        perm = list(range(N))
        rng.shuffle(perm)
        cols.append([(perm[i] + rng.random()) / N for i in range(N)])
    return [(0.80 + 0.40 * b, 0.50 + 0.47 * p, h)
            for b, p, h in zip(*cols)]


def ladder(buyer):
    r, d, h = buyer
    if h <= 0.4:
        return (1.00, 1) if r >= 1.00 else None
    for k in range(12):
        p = max(0.80, 1.00 - 0.05 * k)
        nxt = max(0.80, 1.00 - 0.05 * (k + 1))
        if r >= p and (r - p >= d * (r - nxt) or p == nxt):
            return p, k + 1
    return None


avg = (0.80 + 0.40 * 0.5, 0.50 + 0.47 * 0.5, 0.5)
p, k = ladder(avg)
print("average buyer: R %.3f, d %.3f -> price %.2f in %d rounds"
      % (avg[0], avg[1], p, k))
print("average buyer margin %.2f vs floor %.2f: %s"
      % (p - COST, FLOOR_M, "pass" if p - COST >= FLOOR_M - 1e-9
                                 else "FAIL"))
rng = random.Random(20261113)
deals = sorted(x[0] - COST for x in map(ladder, crowd(rng)) if x)
n = len(deals)
below = len([m for m in deals if m < FLOOR_M - 1e-9])
print("crowd deals: %d of %d" % (n, N))
print("deals below the margin floor: %d (%.4f of deals)"
      % (below, below / n))
for q in (0.05, 0.25, 0.50):
    print("margin per deal, %2d th percentile: %.2f"
          % (round(q * 100), deals[int(q * (n - 1))]))

Single source and citation

Fan, Y. (2026). Red-Blue Synthetic-Customer Sandboxes: Multi-Round Bargaining against Parameterised Demanding Buyers and Pre-Launch Leak Detection (Version 1.0.0), Chapter 4: Parameterised Demanding Buyers: a Multi-Round Haggling Sandbox, Concession Ladders and the Margin Floor. 5D Library. DOI pending

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

BibTeX
@book{fan2026259,
  author    = {Fan, Yafu},
  title     = {Red-Blue Synthetic-Customer Sandboxes: Multi-Round Bargaining against Parameterised Demanding Buyers and Pre-Launch Leak Detection},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book