What does Red-Blue Synthetic-Customer Sandboxes conclude, in numbers, about “Dissent and Limits: Pairwise Covering Designs, Over-Tidy Synthetic Personas and the Average-Buyer Fallacy”?

Answer: Program p21 shows that covering all 392 two-way combinations takes a greedy covering array 51 buyers and random crowds more than two hundred. Program p22 shows that a generator shrinking the standard deviation to 0.6 cuts one-trait tail buyers by a factor of 16.3 and joint two-trait tail buyers by a factor of 267.2. Program p23 shows that when the average buyer clears the bar, 0.4505 of the crowd may still sit below it. The coverage question is settled for now. The next question is this: when a demanding buyer sits down to haggle, how much does each side walk away with?

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.6, 16.3, 267.2

real 95th percentile z = 1.645
sd stail sharebuyers for 95%joint tailbuyers
1.00.05000592.50e-031197
0.90.03380881.14e-032621
0.80.019891503.96e-047573
0.70.009393188.82e-0533961
0.60.003069789.36e-06320207
0.50.0005059732.51e-0711913332
tail share falls by a factor of 16.3 at s = 0.6
joint tail falls by a factor of 267.2 at s = 0.6
Show the full program
# Chapter 2. p22: a persona generator that is too tidy loses the tail.
# Bisbee et al. (2024, Political Analysis) found that answers from
# language-model personas were less varied than real survey answers.
# Model (illustrative): a buyer trait is standard normal among real
# buyers; the generator draws it with the right mean but a standard
# deviation shrunk to s. A "tail buyer" is beyond the real 95th
# percentile (z > 1.645). We print the share of tail buyers the
# generator produces, buyers needed to meet one with 95 per cent
# chance, and the same for a joint tail on two independent traits.
import math
from statistics import NormalDist

Z = NormalDist().inv_cdf(0.95)


def need(p):
    return math.ceil(math.log(0.05) / math.log(1 - p))


print("real 95th percentile z = %.3f" % Z)
print("  sd s   tail share   buyers for 95%   joint tail   buyers")
for s in (1.0, 0.9, 0.8, 0.7, 0.6, 0.5):
    p = 1 - NormalDist(0, s).cdf(Z)
    q = p * p
    print("  %.1f    %.5f      %6d          %.2e   %8d"
          % (s, p, need(p), q, need(q)))
p1 = 1 - NormalDist(0, 1.0).cdf(Z)
p6 = 1 - NormalDist(0, 0.6).cdf(Z)
print("tail share falls by a factor of %.1f at s = 0.6" % (p1 / p6))
print("joint tail falls by a factor of %.1f at s = 0.6"
      % ((p1 / p6) ** 2))

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 2: Dissent and Limits: Pairwise Covering Designs, Over-Tidy Synthetic Personas and the Average-Buyer Fallacy. 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