What does Cold-Start Price Testing conclude, in numbers, about “Prices as Arms: Discrete Price Ladders, Epsilon-Greedy, UCB1 and Revenue Sampling”?

Answer: Cutting Chapter 2's band into three to five geometrically spaced arms and defining the reward as revenue per visitor are the premises of everything in this chapter; in the invented 99, 129, 159 and 209 sample, 99 yuan converts best and 159 yuan earns most. Six thousand launch visitors are far too few for a fixed test to separate neighbouring arms, and a bandit's value is to make learning cheap: revenue Thompson sampling averages 5,949 yuan of regret, an even split 9,074 and conversion Thompson 12,739. UCB1's half-width is uselessly wide when purchases are rare, and epsilon-greedy carries a lock-in gamble. A prior built Chapter 3's way saves over a thousand yuan more, provided it is not overconfident, and daily batched updates cost almost nothing. The next chapter adds market, channel and new versus returning customers as context, and draws the lines that segment pricing must not cross.

Scope of the numbers: Laws on price display and segment pricing are described only in general terms and are not legal or tax advice. Marked boxes separate published evidence, runnable calculations, sources and the author's hypotheses, each stating what would refute it; the source studied is the "Guoxu" chapter of the Guanzi on gathering and releasing goods and the "level" price.

中文版

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: 129, 159, 209, 99

geometric ladders inside [96, 212] yuan, snapped to prices ending in 9
K3: step ratio 1.4860 raw 96.0 142.7 212.0 snapped [99, 139, 209]
K4: step ratio 1.3022 raw 96.0 125.0 162.8 212.0 snapped [99, 129, 159, 209]
K5: step ratio 1.2190 raw 96.0 117.0 142.7 173.9 212.0 snapped [99, 119, 139, 169, 209]
K6: step ratio 1.1717 raw 96.0 112.5 131.8 154.4 180.9 212.0 snapped [99, 109, 129, 159, 179, 209]
arithmetic K4: raw 96.0 134.7 173.3 212.0 snapped [99, 139, 169, 209]; step ratios 1.403 1.287 1.223
arm conv rev/visitor profit/visitor sd(rev)/visitor
990.100 9.900 6.100 29.70
1290.088 11.352 8.008 36.55
1590.080 12.720 9.680 43.14
2090.052 10.868 8.892 46.40
best conversion arm 99, best revenue arm 159, best profit arm 159
revenue gaps to the best arm99: 2.820, 129: 1.368, 159: 0.000, 209: 1.852
profit gaps to the best arm99: 3.580, 129: 1.672, 159: 0.000, 209: 0.788
best revenue arm keeps 4/50.800 of the top conversion at 1.606 x the price
visitors per arm a fixed A/B test needs to separate the best arm from each rival (revenue)
159 vs 99: gap 2.820 yuan/visitor, n2,708 per arm
159 vs 129: gap 1.368 yuan/visitor, n13,406 per arm
159 vs 209: gap 1.852 yuan/visitor, n9,186 per arm
six weeks x 1,000 visitors: horizon 6,000; even split costs 1.510/visitor, 9,060 total
best-revenue arm earns 76,320 over the horizon; the best-conversion arm earns 59,400
Show the full program
# Chapter 4. p40: Turning a Van Westendorp band into a ladder of price arms, and what each arm earns.
# Band ends are the rounded chapter 2 sample bounds (PMC about 96, PME about 212 yuan, convention A).
# Arms are spaced geometrically (equal percentage steps) and snapped to the nearest price ending in 9.
# The conversion per product-page visitor at each arm is a fictional "true" table for the fictional
# Yanchi Studio card set; the algorithms in p42-p44 never see it, they only see simulated purchases.
# Unit cost (print, box, pack) is a fictional 38 yuan.
import math
from fractions import Fraction

LOW, HIGH = 96, 212
ARMS = [99, 129, 159, 209]
CONV = [0.100, 0.088, 0.080, 0.052]
COST = 38
Z = 1.959964 + 0.841621                       # two-sided alpha 0.05, power 0.80


def snap9(x):
    return 10 * round((x + 1) / 10) - 1


print("geometric ladders inside [{}, {}] yuan, snapped to prices ending in 9".format(LOW, HIGH))
for k in (3, 4, 5, 6):
    step = (HIGH / LOW) ** (1 / (k - 1))
    raw = [LOW * step ** i for i in range(k)]
    print("   K={}: step ratio {:.4f}  raw {}  snapped {}".format(
        k, step, " ".join("{:.1f}".format(r) for r in raw), [snap9(r) for r in raw]))
arith = [LOW + (HIGH - LOW) * i / 3 for i in range(4)]
print("   arithmetic K=4: raw {} snapped {}; step ratios {}".format(
    " ".join("{:.1f}".format(a) for a in arith), [snap9(a) for a in arith],
    " ".join("{:.3f}".format(arith[i + 1] / arith[i]) for i in range(3))))

print("arm  conv   rev/visitor  profit/visitor  sd(rev)/visitor")
rev = [p * c for p, c in zip(ARMS, CONV)]
prof = [(p - COST) * c for p, c in zip(ARMS, CONV)]
sd = [p * math.sqrt(c * (1 - c)) for p, c in zip(ARMS, CONV)]
for i, p in enumerate(ARMS):
    print("{:4d}  {:.3f}  {:11.3f}  {:14.3f}  {:15.2f}".format(p, CONV[i], rev[i], prof[i], sd[i]))
bc, br, bp = CONV.index(max(CONV)), rev.index(max(rev)), prof.index(max(prof))
print("best conversion arm {}, best revenue arm {}, best profit arm {}".format(ARMS[bc], ARMS[br], ARMS[bp]))
print("revenue gaps to the best arm: " + ", ".join(
    "{}: {:.3f}".format(p, rev[br] - r) for p, r in zip(ARMS, rev)))
print("profit gaps to the best arm:  " + ", ".join(
    "{}: {:.3f}".format(p, prof[bp] - r) for p, r in zip(ARMS, prof)))
drop = Fraction(round(CONV[br] * 1000), round(CONV[bc] * 1000))
print("best revenue arm keeps {} = {:.3f} of the top conversion at {:.3f} x the price".format(
    drop, float(drop), ARMS[br] / ARMS[bc]))

print("visitors per arm a fixed A/B test needs to separate the best arm from each rival (revenue)")
for i, p in enumerate(ARMS):
    if i == br:
        continue
    gap = rev[br] - rev[i]
    n = Z * Z * (sd[br] ** 2 + sd[i] ** 2) / gap ** 2
    print("   {} vs {}: gap {:.3f} yuan/visitor, n = {:,} per arm".format(ARMS[br], p, gap, math.ceil(n)))
T = 6000
loss_even = math.fsum(rev[br] - r for r in rev) / len(ARMS)
print("six weeks x 1,000 visitors: horizon {:,}; even split costs {:.3f}/visitor, {:,.0f} total"
      .format(T, loss_even, T * loss_even))
print("best-revenue arm earns {:,.0f} over the horizon; the best-conversion arm earns {:,.0f}".format(
    T * rev[br], T * rev[bc]))

Single source and citation

Fan, Y. (2026). Zero-History Cold-Start Price Testing, Van Westendorp Sensitivity Bounds and Bayesian Adaptive Repricing (Version 0.1.0), Chapter 4: Prices as Arms: Discrete Price Ladders, Epsilon-Greedy, UCB1 and Revenue Sampling. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-133 · v0.1.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026133,
  author    = {Fan, Yafu},
  title     = {Zero-History Cold-Start Price Testing, Van Westendorp Sensitivity Bounds and Bayesian Adaptive Repricing},
  year      = {2026},
  publisher = {5D Library},
  edition   = {0.1.0},
  note      = {DOI pending}
}

Other chapter answers in this book