Source: J. Appl. Probab.
Volume 48, Number 4
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.
Full-text: Access denied (no subscription
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Azar, Z., Broder, A. Z., Karlin, A. R. and Upfal, E. (1999). Balanced allocations. SIAM J. Comput. 29, 180–200.
Feller, W. (1950). An Introduction to Probability Theory and Its Applications. John Wiley, New York.
Mathematical Reviews (MathSciNet): MR38583
Foata, D. and Zeilberger, D. (2003). The collector's brotherhood problem using the Newman-Shepp symbolic method. Algebra Universalis 49, 387–395.
Holst, L. (2001). Extreme value distributions for random coupon collector and birthday problems. Extremes 4, 129–145.
Kan, N. D. (2005). Martingale approach to the coupon collection problem. J. Math. Sci. 127, 1737–1744.
Mitzenmacher, M. D. (1996). The power of two choices in randomized load balancing. Doctoral Thesis, University of California, Berkeley.
Myers, A. N. and Wilf, H. S. (2003). Some new aspects of the coupon-collector's problem. SIAM J. Discrete Math. 17, 1–17.
Neal, P. (2008). The generalised coupon collector problem. J. Appl. Prob. 45, 621–629.
Newman, D. J. and Shepp, L. (1960). The double dixie cup problem. Amer. Math. Monthly 67, 58–61.
Mathematical Reviews (MathSciNet): MR120672
Sharif, M. and Hassibi, B. (2006). Delay considerations for opportunistic scheduling in broadcast fading channels. IEEE Trans. Wireless Commun. 6, 3353–3363.