Author:
Brown Mark,Peköz Erol A.,Ross Sheldon M.
Abstract
We consider the classical coupon collector's problem in which each new coupon collected is type i with probability pi; ∑i=1npi=1. We derive some formulas concerning N, the number of coupons needed to have a complete set of at least one of each type, that are computationally useful when n is not too large. We also present efficient simulation procedures for determining P(N > k), as well as analytic bounds for this probability.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference3 articles.
1. The coupon-collector's problem revisited
2. Strong Stationary Times Via a New Form of Duality
3. 3. Ross S. & Peköz E.A. (2007). A second course in probability (probabilitybookstore.com.)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献