What does Choice Architecture and Pricing Interfaces conclude, in numbers, about “Practice and Pre-Registered Testing”?

Answer: Chapter 8 gives a four-step checklist (options, reference prices, decoys, friction and defaults) and a pre-registered online randomised experiment: on a three-tier pricing page for a fictitious product, run by independent researchers, it compares the share choosing the target tier with and without an asymmetrically dominated decoy (single primary outcome, smallest effect of interest 5 percentage points, 90 % power with 1,842 analysable and 2,200 recruited per arm, decision rule written as code). The three-tier example prices of US$9.99, 49.90 and 149.00 match 5D Library's own prices; this is stated in the disclosure, and nothing in the book validates those prices. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's models and hypotheses; all data in the book are fictional or simulated.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's models and hypotheses; all data in the book are fictional or simulated.

中文版

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: 16, 1842, 2200

rough order of magnitude for the SESOI: lab shift x field detection rate
   (whole-sample shifts in numeric lab studies, Frederick et al. 2014: +14, +16,
   +24 points; detection 11-25 % in Wu & Cosguner 2020's diamond data)
   detection 11%: 1.5, 1.8, 2.6 points
   detection 25%: 3.5, 4.0, 6.0 points
base share of the target tier 30%, SESOI 5 points: 1,842 per arm analysable
   allowing 15 % exclusions (attention checks, incomplete sessions):
   recruit 2,200 per arm, 4,400 in all
   power at n = 1,842 by the normal approximation: 0.900
   10,000 simulated trials: power 0.895 (MC s.e. 0.003),
   type I error 0.054 (MC s.e. 0.0022)
sensitivity: analysable n per arm      SESOI  3 pts   5 pts   8 pts
   (pre-set rule: if the pilot base share is not 30 %, recompute n for SESOI 5
    at the pilot share and use the larger of that and 1,842)
   base share 20%                       3,939   1,464     597
   base share 30%                       5,037   1,842     735
   base share 40%                       5,667   2,053     807
Show the full program
# Sample size for the Chapter 8 pre-registered online experiment. Arms: A = three tiers
# of a fictitious subscription (12 / 39 / 89 dollars, NOT the author's products); B = the
# same page plus an asymmetrically dominated decoy next to the middle (target) tier.
# Single primary outcome: chose the target tier (binary). Two-sided alpha 0.05,
# power 90 %.
# n per arm = (z_a sqrt(2 pbar qbar) + z_b sqrt(p1 q1 + p2 q2))^2 / (p2 - p1)^2.
import math, random, statistics

Z = statistics.NormalDist().inv_cdf
ZA, ZB = Z(0.975), Z(0.90)

def n_arm(p1, p2):
    pb = (p1 + p2) / 2
    num = (ZA * math.sqrt(2 * pb * (1 - pb))
           + ZB * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2))) ** 2
    return math.ceil(num / (p2 - p1) ** 2)

print("rough order of magnitude for the SESOI: lab shift x field detection rate")
print("   (whole-sample shifts in numeric lab studies, Frederick et al. 2014: +14, +16,")
print("   +24 points; detection 11-25 % in Wu & Cosguner 2020's diamond data)")
for d in (0.11, 0.25):
    print(f"   detection {d:.0%}: " + ", ".join(f"{d * e:.1f}" for e in (14, 16, 24))
          + " points")
P1, D = 0.30, 0.05
n = n_arm(P1, P1 + D)
plan = math.ceil(n / 0.85 / 100) * 100
print(f"base share of the target tier {P1:.0%}, SESOI {100 * D:.0f} points:"
      f" {n:,} per arm analysable")
print(f"   allowing 15 % exclusions (attention checks, incomplete sessions):")
print(f"   recruit {plan:,} per arm, {2 * plan:,} in all")
rng = random.Random(47); hits = alpha = 0; NSIM = 10000
for _ in range(NSIM):                                    # simulation check of the formula
    for p2, null in ((P1 + D, False), (P1, True)):
        a = sum(rng.random() < P1 for _ in range(n)) / n     # Bernoulli sums:
        b = sum(rng.random() < p2 for _ in range(n)) / n     # portable to Python 3.8+
        se = math.sqrt(a * (1 - a) / n + b * (1 - b) / n)
        sig = abs(b - a) / se > ZA
        alpha += sig and null; hits += sig and not null
se_p, se_a = math.sqrt(0.9 * 0.1 / NSIM), math.sqrt(0.05 * 0.95 / NSIM)
q1, q2, pb = P1 * (1 - P1), (P1 + D) * (1 - P1 - D), P1 + D / 2
exact = statistics.NormalDist().cdf((D * math.sqrt(n) - ZA * math.sqrt(2 * pb * (1 - pb)))
                                    / math.sqrt(q1 + q2))
print(f"   power at n = {n:,} by the normal approximation: {exact:.3f}")
print(f"   {NSIM:,} simulated trials: power {hits / NSIM:.3f} (MC s.e. {se_p:.3f}),")
print(f"   type I error {alpha / NSIM:.3f} (MC s.e. {se_a:.4f})")
print("sensitivity: analysable n per arm      SESOI  3 pts   5 pts   8 pts")
print("   (pre-set rule: if the pilot base share is not 30 %, recompute n for SESOI 5")
print("    at the pilot share and use the larger of that and 1,842)")
for p1 in (0.20, 0.30, 0.40):
    print(f"   base share {p1:.0%}                    " + "".join(
        f"{n_arm(p1, p1 + d):8,d}" for d in (0.03, 0.05, 0.08)))

Single source and citation

Fan, Y. (2026). Choice Architecture, Cumulative Prospect Theory and Computational Behavioural Economics of Pricing Interfaces (Version 1.0.0), Chapter 8: Practice and Pre-Registered Testing. 5D Library. https://doi.org/10.5281/zenodo.23836260

DOI: 10.5281/zenodo.23836260 · Read the monograph · 5DL-B-047 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026047,
  author    = {Fan, Yafu},
  title     = {Choice Architecture, Cumulative Prospect Theory and Computational Behavioural Economics of Pricing Interfaces},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23836260},
  url       = {https://doi.org/10.5281/zenodo.23836260}
}

Other chapter answers in this book