A Generalized Coupon Collector Problem
2011 ◽
Vol 48
(4)
◽
pp. 1081-1094
◽
Keyword(s):
This paper presents an analysis of a generalized version of the coupon collector problem, in which the collector receives d coupons each run and chooses the least-collected coupon so far. In the asymptotic case when the number of coupons n goes to infinity, we show that, on average, (nlogn) / d + (n / d)(m − 1)log logn + O(mn) runs are needed to collect m sets of coupons. An exact algorithm is also developed for any finite case to compute the exact mean number of runs. Numerical examples are provided to verify our theoretical predictions.
2011 ◽
Vol 48
(04)
◽
pp. 1081-1094
◽
Keyword(s):
2011 ◽
Vol 07
(04)
◽
pp. 1001-1032
◽
Keyword(s):
1985 ◽
Vol 107
(2)
◽
pp. 244-249
◽
1990 ◽
Vol 48
(4)
◽
pp. 574-575
Keyword(s):
1997 ◽
Vol 48
(3)
◽
pp. 324-331
◽