The Coupon Collector's Problem Revisited: Generalizing the Double Dixie Cup Problem of Newman and Shepp
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 Tm(N) of coupons that a collector has to buy in order to complete m sets of all N existing different coupons. More precisely, the problem is to determine the asymptotics of the expectation (and the variance) of Tm(N), as well as its limit distribution, as the number N 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 Tm(N). Then, we develop techniques of computing the asymptotics of the first and the second moment of Tm(N) (our techniques apply to the higher moments of Tm(N) as well). From these asymptotic formulas we obtain the leading behavior of the variance V[\,Tm(N)\,] as N ∞. Finally, based on the asymptotics of E[\,Tm(N)\,] and V[\,Tm(N)\,] we obtain the limit distribution of the random variable Tm(N) for large classes of coupon probabilities. As it turns out, in many cases, albeit not always, Tm(N) (appropriately normalized) converges in distribution to a Gumbel random variable. Our results on the limit distribution of Tm(N) generalize a well-known result of P. Erdos and A. R\'enyi (1961) regarding the limit distribution of Tm(N) for the case of equal coupon probabilities.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.