The Coupon Collector's Problem Revisited: Generalizing the Double Dixie Cup Problem of Newman and Shepp
Aristides V. Doumas, Vassilis G. Papanicolaou

TL;DR
This paper extends the classical coupon collector's problem to cases with unequal coupon probabilities, analyzing the asymptotics of the number of coupons needed to collect multiple sets and identifying the limit distribution as often Gumbel.
Contribution
It generalizes the known results for equal probabilities to unequal probabilities, providing asymptotic formulas and limit distributions for the generalized problem.
Findings
Asymptotic formulas for the expectation and variance of T_m(N)
Limit distribution of T_m(N) often converges to Gumbel
Techniques applicable to higher moments of T_m(N)
Abstract
The "double Dixie cup problem" of D.J. Newman and L. Shepp (1960) is a well-known variant of the coupon collector's problem, where the object of study is the number of coupons that a collector has to buy in order to complete sets of all existing different coupons. More precisely, the problem is to determine the asymptotics of the expectation (and the variance) of , as well as its limit distribution, as the number of different coupons becomes arbitrarily large. The classical case of the problem, namely the case of equal coupon probabilities, is here extended to the general case, where the probabilities of the selected coupons are unequal. In the beginning of the article we give a brief review of the formulas for the moments and the moment generating function of the random variable . Then, we develop techniques of computing the asymptotics of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
