What does Blind Boxes, Hidden Variants and Odds Disclosure conclude, in numbers, about “Duplicates, Pooling and Buying the Gaps: the Double Dixie Cup and When to Stop Opening”?

Answer: A buyer who completes 12 designs holds 25.24 duplicates on average, and after box 24 each further box has less than a one-in-eight chance of being new. The double Dixie cup formula of Newman and Shepp shows that pooling cuts each member's share from 37.24 boxes to 29.02 for two people and 18.91 for ten, but never down to the number of designs. With single designs at 139 on the resale market and no sale of duplicates, the best plan is to stop opening when about 5 designs are missing, at an expected 1373.9, a little over half the 2569.5 of opening to the end. That closes the mathematics of blind boxes. Another product that depends just as much on chance, but is sold by value rather than by design, is the lucky bag. How should its expected value and spread be computed, and how should they be disclosed? Chapter 5 answers.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is general information, not individualised legal or financial advice, and every statute must be checked by a person before listing. Chapter 5 computes a lucky bag's mean, spread and chance of being worth less than its price (0.8280 for the illustrative bag) and the weighting of small chances.

中文版

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: 12, 18.91, 29.02, 37.24

m setsE[boxes]per setper set / 12saving vs alone
137.2437.243.1030.000
258.0529.022.4190.221
376.5625.522.1270.315
493.9823.501.9580.369
6126.9721.161.7640.432
10189.1118.911.5760.492
check: 12 * H_12 = 37.2385, integral gives 37.2385
Show the full program
# Chapter 4. p42: m friends pooling boxes to complete m sets.
# Newman and Shepp (1960), the "double Dixie cup" problem: the expected
# number of boxes needed to hold at least m copies of each of n equally
# likely designs is
#   E_m = n * integral_0^inf [1 - (1 - S_m(t) e^-t)^n] dt,
#   S_m(t) = sum_{k < m} t^k / k!.
# Evaluated by Simpson's rule on [0, 80] with 16,000 panels; n = 12.
# Pooling assumes perfect swapping inside the group (illustrative).
import math

N = 12


def integrand(t, m):
    s = math.fsum(t ** k / math.factorial(k) for k in range(m))
    return 1.0 - (1.0 - s * math.exp(-t)) ** N


def e_m(m):
    a, b, n = 0.0, 80.0, 16000
    h = (b - a) / n
    terms = [integrand(a, m), integrand(b, m)]
    terms += [4 * integrand(a + (2 * i - 1) * h, m)
              for i in range(1, n // 2 + 1)]
    terms += [2 * integrand(a + 2 * i * h, m) for i in range(1, n // 2)]
    return N * h / 3 * math.fsum(terms)


print(" m sets   E[boxes]   per set   per set / 12   saving vs alone")
alone = e_m(1)
for m in (1, 2, 3, 4, 6, 10):
    e = e_m(m)
    print("  {:2d}     {:7.2f}    {:6.2f}     {:.3f}         {:.3f}".format(
        m, e, e / m, e / m / N, 1 - (e / m) / alone))
print("check: 12 * H_12 = 37.2385, integral gives {:.4f}".format(alone))

Single source and citation

Fan, Y. (2026). Blind-Box Coupon Collecting, Geometric Waits for Hidden Variants and Odds Disclosure for Lucky Bags (Version 1.0.0), Chapter 4: Duplicates, Pooling and Buying the Gaps: the Double Dixie Cup and When to Stop Opening. 5D Library. DOI pending

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

BibTeX
@book{fan2026210,
  author    = {Fan, Yafu},
  title     = {Blind-Box Coupon Collecting, Geometric Waits for Hidden Variants and Odds Disclosure for Lucky Bags},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book