A Survey of the Coupon Collector’s Problem with Random Sample Sizes

This paper surveys the coupon collector’s waiting time problem with random sample sizes and equally likely balls. Consider an urn containing m red balls. For each draw, a random number of balls are removed from the urn. The group of removed balls is painted white and returned to the urn. Several approaches to addressing this problem are discussed, including a Markov chain approach to compute the distribution and expected value of the number of draws required for the urn to contain j white balls given that it currently contains i white balls. As a special case, E[N], the expected number of draws until all the balls are white given that all are currently red is also obtained.

[1]  G. Pólya,et al.  Eine Wahrscheinlichkeitsaufgabe in der Kundenwerbung , 1930 .

[2]  W. Feller,et al.  An Introduction to Probability Theory and Its Application. , 1951 .

[3]  D. Newman.  The Double Dixie Cup Problem , 1960 .

[4]  R. F. Ling,et al.  The Accuracy of Peizer Approximations to the Hypergeometric Distribution, with Comparisons to Some other Approximations , 1984 .

[5]  Xiaobo Li,et al.  A pipeline architecture for computing cumulative hypergeometric distributions , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[6]  L. Holst.  On Birthday, Collectors', Occupancy and Other Classical Urn Problems , 1986 .

[7]  Wolfgang Stadje,et al.  THE COLLECTOR'S PROBLEM WITH GROUP DRAWINGS , 1990 .

[8]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[9]  Chris A. J. Klaassen.  Dixie cups: sampling with replacement from a finite population , 1994 .

[10]  Thomas Sellke.  How Many IID Samples does it Take to See all the Balls in a Box , 1995 .

[11]  G. I. Ivchenko.  How many samples does it take to see all the balls in an urn? , 1998 .

[12]  Robert Bosch.  Optimal Card-Collecting Strategies for Magic: The Gathering , 2000 .

[13]  Ilan Adler,et al.  The coupon subset collection problem , 2001, Journal of Applied Probability.

[14]  Lars Holst,et al.  Extreme Value Distributions for Random Coupon Collector and Birthday Problems , 2001 .

[15]  Some New Aspects of the Coupon Collector's Problem , 2003, SIAM J. Discret. Math..

[16]  S. Martínez,et al.  Sampling from Finite Random Partitions , 2003 .

[17]  David K. Smith,et al.  Decision making and card collecting , 2005 .