Two-Player Coupon-Collector Competition Models

• The topic is a collection of stochastic models where two players compete under varying collection rules, focusing on comparative completion times and residual deficits.
• It covers distinct regimes such as the siblings model, shared-stream races, independent collectors, and multi-draw strategies, each yielding unique probabilistic metrics.
• Key findings include exact win probabilities, harmonic deficits with Exp(1) limits, and Gumbel fluctuations, offering deep insights into competitive coupon collection.

Searching arXiv for the cited papers to ground the article in current literature. I’m checking arXiv metadata for the primary papers on two-player coupon-collector variants. Two-player coupon-collector competition denotes a family of stochastic models in which two collections evolve under a coupon-sampling mechanism and one studies either comparative completion times or the lag of one collection relative to the other. The literature does not treat a single universal model. Instead, recent work separates at least four technically distinct regimes: an asymmetric “siblings” model in which player 2 receives only player 1’s duplicates; a shared-stream race between coupon groups; independent simultaneous collectors with one draw per player per round; and multi-draw variants whose single-player completion laws can be repurposed for race calculations (Long, 28 Jun 2026, Doumas et al., 2017, Ferrante et al., 2016, Long, 10 May 2026, Doumas et al., 1 Jul 2026).

1. Model families and competition observables

The principal ambiguity in the topic is the meaning of “competition.” In some papers, player 1 is the only active sampler and player 2 passively inherits duplicates; in others, both players draw independently; in still others, both “players” are coupon groups exposed to one common i.i.d. stream. The random quantity of interest changes accordingly.

Competition rule	Primary observable	Representative paper
Player 2 receives only player 1’s duplicates	$U_2^N$, the number of types missing from player 2 when player 1 finishes	(Long, 28 Jun 2026)
Two groups in one common stream	$\Pr(T_1<T_2)$, $T_1\vee T_2$	(Doumas et al., 2017)
Two independent collectors, one draw each per round	$E[\max(X_1,X_2)]$, ballot event probabilities	(Ferrante et al., 2016, Long, 10 May 2026)
Multi-draw collection with retention rules	Exact and asymptotic laws for single-player completion times	(Doumas et al., 1 Jul 2026)

The most common observables are the win probability $\Pr(T_1<T_2)$, the probability of a tie when ties are admissible, the game duration until both are done, and a deficit variable such as $U_2^N$. A recurring theme is that results are highly model-specific: formulas valid for a shared-stream race generally do not transfer to independent streams, and deficit-at-stopping-time results do not determine the loser’s eventual completion time.

2. The siblings model: player 2 as the duplicate collector

In the siblings, or brotherhood, model, there are $N$ coupon types with iid draws from a strictly positive probability vector

$$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$

Player 1 keeps the first copy of each type and stops when every type has appeared. Duplicates are passed down the line to later siblings. For the two-player specialization, the central variable is

$U_2^N,$

the number of coupon types still missing from player 2’s album at the stopping time of player 1. Equivalently, $U_2^N$ counts the types that have appeared fewer than $\Pr(T_1<T_2)$0 times by player 1’s completion time; these are exactly the types seen once by then (Long, 28 Jun 2026).

The exact expectation admits both Poissonized and finite subset forms. If $\Pr(T_1<T_2)$1, then

$\Pr(T_1<T_2)$2

and also

$\Pr(T_1<T_2)$3

In the uniform case $\Pr(T_1<T_2)$4, this collapses to

$\Pr(T_1<T_2)$5

so the expected number of types missing from player 2 when player 1 finishes is exactly the harmonic number $\Pr(T_1<T_2)$6 (Long, 28 Jun 2026).

A central finite-$\Pr(T_1<T_2)$7 theorem is extremality of the uniform distribution. Writing $\Pr(T_1<T_2)$8 and $\Pr(T_1<T_2)$9, one has

$T_1\vee T_2$0

and, more strongly, along every nonconstant ray $T_1\vee T_2$1,

$T_1\vee T_2$2

Thus, among all strictly positive coupon distributions on $T_1\vee T_2$3 types, the expected deficit of player 2 is uniquely maximized by the uniform distribution (Long, 28 Jun 2026). An alternative finite-$T_1\vee T_2$4 proof rewrites the radial derivative as the negative of an integral of weighted variances,

$T_1\vee T_2$5

again making the sign transparent (Doumas et al., 19 Jun 2026).

The uniform model also has sharp stochastic and asymptotic structure. First, $T_1\vee T_2$6 is stochastically increasing in $T_1\vee T_2$7, and there is an almost-sure coupling

$T_1\vee T_2$8

Second, after normalization by $T_1\vee T_2$9,

$E[\max(X_1,X_2)]$0

Hence player 2’s deficit at player 1’s completion time is of order $E[\max(X_1,X_2)]$1, not $E[\max(X_1,X_2)]$2, and the fluctuation scale is also logarithmic (Long, 28 Jun 2026). The earlier one-brother asymptotic theorem established the same limit law in the equal-probability case and also recorded

$E[\max(X_1,X_2)]$3

with $E[\max(X_1,X_2)]$4 (Papanicolaou et al., 2020).

Recent work strengthens expectation extremality to transform orders. Along every ray from the uniform vector, the full PGF satisfies

$E[\max(X_1,X_2)]$5

strictly decreasing for $E[\max(X_1,X_2)]$6 and strictly increasing for $E[\max(X_1,X_2)]$7, and every binomial moment $E[\max(X_1,X_2)]$8 decreases away from uniformity (Long, 30 Jun 2026). The paper explicitly emphasizes that these are PGF, Laplace-transform, and binomial-moment order statements, not ordinary stochastic order.

3. Shared-stream races between two coupon groups

A different interpretation of two-player competition appears when a single coupon stream is partitioned into groups. Group $E[\max(X_1,X_2)]$9 contains $\Pr(T_1<T_2)$0 distinct coupons, every coupon in that group has per-coupon probability $\Pr(T_1<T_2)$1, and

$\Pr(T_1<T_2)$2

If $\Pr(T_1<T_2)$3 is the number of trials needed to detect all $\Pr(T_1<T_2)$4 coupons of Group $\Pr(T_1<T_2)$5, then in the two-group case a head-to-head race is governed by the comparison of $\Pr(T_1<T_2)$6 and $\Pr(T_1<T_2)$7 (Doumas et al., 2017).

The exact win probability is available in integral and finite-sum form. In the two-group case,

$\Pr(T_1<T_2)$8

and equivalently

$\Pr(T_1<T_2)$9

The paper states that ties are impossible between distinct groups, so

$U_2^N$0

This makes the two-group model a genuine strict race under a common coupon stream (Doumas et al., 2017).

The asymptotic regime treated in detail fixes

$U_2^N$1

with $U_2^N$2. Then

$U_2^N$3

Hence, if $U_2^N$4, player 1’s chance of beating player 2 goes to $U_2^N$5 polynomially fast, regardless of the size ratio $U_2^N$6. In this model, per-coupon appearance rate dominates group size at leading asymptotic order (Doumas et al., 2017).

The same paper analyzes the time until both groups are complete,

$U_2^N$7

When $U_2^N$8, the slower group is Group 1, and the full completion time is asymptotically governed by $U_2^N$9. The derived formulas are

$N$0

$N$1

and

$N$2

Thus the duration until both “players” finish has the standard coupon-collector $N$3 scale and Gumbel fluctuations, but the winner-focused asymptotic is encoded in $N$4 (Doumas et al., 2017).

4. Independent simultaneous collectors

When two collectors draw independently rather than share a stream, a natural state variable is the pair of distinct-count processes. One Markov-chain formulation considers $N$5 parallel collections, with one new coupon for each collection obtained simultaneously at each unit of time, the collections being independent to each other. For $N$6,

$N$7

tracks the number of distinct types held by each player after $N$8 rounds, the absorbing state is $N$9, and the transition probabilities are

$$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$0

If $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$1 is the transient-state submatrix and $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$2, then the expected time until both players finish is the $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$3 component of $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$4, and the variance vector is

$$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$5

This provides a computational method for $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$6 and $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$7, but not closed forms for $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$8, $$p=(p_1,\dots,p_N),\qquad p_i>0,\qquad \sum_{i=1}^N p_i=1.$$9, or $U_2^N,$0 (Ferrante et al., 2016).

A more refined independent-stream question is the ballot event. In the symmetric two-player model with $U_2^N,$1 equally likely coupon types, players $U_2^N,$2 and $U_2^N,$3 each draw one coupon per round, independently. If $U_2^N,$4 and $U_2^N,$5 are the numbers of distinct types seen by round $U_2^N,$6, and $U_2^N,$7 are the completion times, the event that $U_2^N,$8 wins and is never behind is

$U_2^N,$9

Defining

$U_2^N$0

the main theorem is

$U_2^N$1

Equivalently, for a fixed labeled player,

$U_2^N$2

Thus the event that the eventual winner was never behind is rare, of order $U_2^N$3, even though either player may eventually win (Long, 10 May 2026).

The proof decomposes the process at the tie boundary and identifies the first one-sided tie-break level $U_2^N$4. Its entrance law satisfies

$U_2^N$5

and

$U_2^N$6

After the first break, the leader’s survival probability is asymptotically controlled by the Catalan or gambler’s-ruin harmonic

$U_2^N$7

This produces the clean asymptotic $U_2^N$8 (Long, 10 May 2026).

5. Multi-draw models and retention rules

Recent work on multi-draw coupon collection does not study a two-player race directly, but it provides exact completion-time formulas and asymptotics that can be reused in independent-race calculations. Here a trial consists of observing a uniformly random $U_2^N$9-subset of the $\Pr(T_1<T_2)$00 coupon types, with no duplicates within a trial and iid trials across time (Doumas et al., 1 Jul 2026).

Problem I is the “keep all new observed coupons” rule. If $\Pr(T_1<T_2)$01 is the number of trials until all $\Pr(T_1<T_2)$02 types have been collected at least once, then

$\Pr(T_1<T_2)$03

and the exact CDF is

$\Pr(T_1<T_2)$04

Its asymptotic mean expansion begins

$\Pr(T_1<T_2)$05

and the normalized completion time converges to standard Gumbel: $\Pr(T_1<T_2)$06 The variance satisfies

$\Pr(T_1<T_2)$07

All of these are exact or asymptotically sharp single-player inputs for independent two-player comparisons (Doumas et al., 1 Jul 2026).

Problem II retains only one coupon from the observed $\Pr(T_1<T_2)$08-subset, namely the least-collected coupon so far. Writing

$\Pr(T_1<T_2)$09

the completion time decomposes as

$\Pr(T_1<T_2)$10

with the $\Pr(T_1<T_2)$11 independent. Hence

$\Pr(T_1<T_2)$12

The mean has expansion

$\Pr(T_1<T_2)$13

where

$\Pr(T_1<T_2)$14

and the limit law is

$\Pr(T_1<T_2)$15

The variance is sharper here: $\Pr(T_1<T_2)$16 Thus Problems I and II share the same leading $\Pr(T_1<T_2)$17 scale and the same Gumbel fluctuation scale $\Pr(T_1<T_2)$18, but Problem II carries an additional $\Pr(T_1<T_2)$19 delay (Doumas et al., 1 Jul 2026).

This suggests a direct race implication for independent players: comparing two such completion times reduces asymptotically to comparing shifted Gumbel variables. A plausible implication is that, for fixed $\Pr(T_1<T_2)$20, Problem I should asymptotically beat Problem II because the latter is centered later by $\Pr(T_1<T_2)$21; however, the paper itself does not formulate two-player win probabilities (Doumas et al., 1 Jul 2026).

6. Scope, limitations, and recurring misconceptions

A persistent misconception is that “two-player coupon-collector competition” refers to a single standard model. The recent literature shows the opposite. In the siblings model, the stopping rule is player 1’s completion time, and the main object is player 2’s residual deficit $\Pr(T_1<T_2)$22, not player 2’s eventual completion time (Long, 28 Jun 2026). In the shared-stream two-group model, both completion times are defined relative to one common coupon stream and ties are impossible (Doumas et al., 2017). In the independent-parallel model, each player has an independent draw every round, and the main Markov-chain output is the time until both are complete, not who wins (Ferrante et al., 2016).

A second misconception is to identify deficit-order results with full stochastic ordering. The transform-extremality results for $\Pr(T_1<T_2)$23 prove radial monotonicity of the PGF for $\Pr(T_1<T_2)$24, radial monotonicity of the Laplace transform for $\Pr(T_1<T_2)$25, and monotonicity of every binomial moment along rays from the uniform distribution. They do not establish ordinary stochastic order or increasing-convex order between the corresponding laws (Long, 30 Jun 2026).

A third misconception is to conflate “winner never behind” with “winner finishes first.” The ballot event

$\Pr(T_1<T_2)$26

is much stricter than merely winning the race, and its probability is only asymptotically $\Pr(T_1<T_2)$27 for a specified player, or $\Pr(T_1<T_2)$28 if one counts either player as the never-behind winner (Long, 10 May 2026).

Taken together, the current literature supports a precise taxonomy. In asymmetric duplicate-passing competitions, the canonical quantity is a deficit variable $\Pr(T_1<T_2)$29 with exact formulas, extremality at the uniform law, stochastic growth in $\Pr(T_1<T_2)$30, and an $\Pr(T_1<T_2)$31 limit after $\Pr(T_1<T_2)$32 normalization (Long, 28 Jun 2026). In shared-stream group races, exact win probabilities and Gumbel-scaled overall completion times are available (Doumas et al., 2017). In independent simultaneous races, absorbing-chain and ballot methods govern the time until both finish and the probability that the eventual winner was never behind (Ferrante et al., 2016, Long, 10 May 2026). In multi-draw models, exact completion laws and asymptotic expansions furnish the single-player inputs needed for subsequent head-to-head analysis (Doumas et al., 1 Jul 2026).