Article contents
A Generalized Coupon Collector Problem
Published online by Cambridge University Press: 14 July 2016
Abstract
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.
Keywords
MSC classification
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 2011
References
- 9
- Cited by