What does Whitelist Licensing, Hooks and Scout Attribution conclude, in numbers, about “The Pixel Cold Start and Thompson Sampling”?
Answer: Chapter 4 runs the cold start with Thompson sampling, which after three thousand clicks picks the best creative in a share of only 0.765.
Scope of the numbers: Its parameters are illustrative, all calculations are generated by its programs, and it is general analysis, not business or legal advice. Chapter 6 prices the bypass option on a binomial tree, where a damages clause at the reasonable pre-estimate of 20.82 deters every bypass in the illustrative model.
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.765
| oracle orders 90; 200 runs of 3,000 clicks | ||||
| policy | mean orders | regret | clicks on best | final pick best |
| split | 73.36 | 16.64 | 0.333 | 0.710 |
| commit | 77.21 | 12.79 | 0.393 | 0.400 |
| thompson | 78.00 | 12.00 | 0.520 | 0.765 |
Show the full program
# Chapter 4. p41: cold start of three licensed hooks, three policies.
# Three creatives convert a click with probability 0.020, 0.024 and
# 0.030 (illustrative). Each run spends 3,000 clicks.
# split round robin, 1,000 clicks each
# commit 300 test clicks (100 each), then all on the leader
# thompson Beta(1, 1) priors; each click goes to the arm whose
# posterior draw is largest (Thompson 1933)
# 200 runs with a fixed seed; regret is measured against always
# using the best creative (expected 90 orders).
import math
import random
P = (0.020, 0.024, 0.030)
CLICKS, RUNS = 3000, 200
rng = random.Random(1933)
def split():
s = [0, 0, 0]
won = 0
for c in range(CLICKS):
a = c % 3
if rng.random() < P[a]:
s[a] += 1
won += 1
lead = max(range(3), key=lambda i: (s[i], -i))
return won, CLICKS // 3, lead
def commit():
s = [0, 0, 0]
won = 0
for c in range(300):
a = c % 3
if rng.random() < P[a]:
s[a] += 1
won += 1
lead = max(range(3), key=lambda i: (s[i], -i))
for _ in range(CLICKS - 300):
if rng.random() < P[lead]:
won += 1
on_best = 100 + (CLICKS - 300 if lead == 2 else 0)
return won, on_best, lead
def thompson():
s, f = [1, 1, 1], [1, 1, 1]
won, on_best = 0, 0
for _ in range(CLICKS):
draws = [rng.betavariate(s[i], f[i]) for i in range(3)]
a = max(range(3), key=lambda i: draws[i])
if a == 2:
on_best += 1
if rng.random() < P[a]:
s[a] += 1
won += 1
else:
f[a] += 1
lead = max(range(3), key=lambda i: s[i] / (s[i] + f[i]))
return won, on_best, lead
if __name__ == "__main__":
oracle = CLICKS * P[2]
print("oracle orders {:.0f}; {} runs of {:,} clicks".format(
oracle, RUNS, CLICKS))
print(" policy mean orders regret clicks on best"
" final pick best")
for name, pol in (("split", split), ("commit", commit),
("thompson", thompson)):
wins, best, right = [], [], 0
for _ in range(RUNS):
w, b, lead = pol()
wins.append(w)
best.append(b)
if lead == 2:
right += 1
mw = math.fsum(wins) / RUNS
mb = math.fsum(best) / RUNS / CLICKS
print(" {:<8} {:>11.2f} {:>6.2f} {:>14.3f} {:>15.3f}"
.format(name, mw, oracle - mw, mb, right / RUNS))Single source and citation
Fan, Y. (2026). Dark-Ads Whitelist Licensing Economics, Three-Second Hook Survival Analysis and Single-Tier Scout Attribution Games (Version 1.0.0), Chapter 4: The Pixel Cold Start and Thompson Sampling. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-333 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026333,
author = {Fan, Yafu},
title = {Dark-Ads Whitelist Licensing Economics, Three-Second Hook Survival Analysis and Single-Tier Scout Attribution Games},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Dashboard Attribution Cannot Price a Licence
- Chapter 2 · Pricing a Licence along the Wear-Out Curve
- Chapter 3 · The Three-Second Hook as a Survival Problem
- Chapter 5 · Single-Tier Scout Commission by Shapley Value
- Chapter 6 · Liquidated Damages against Bypass Deals, and Statistical Power
- Chapter 7 · Buying the Box and Returning the Pearl, and Scientific Advertising
- Chapter 8 · The Monthly Review and a Pre-Registered Refutation