Coupon collecting

被引：9

作者：

Brown, Mark ^{[1
]}

Pekoz, Erol A. ^{[2
]}

Ross, Sheldon M. ^{[3
]}

机构：

[1] CUNY City Coll, Dept Math, New York, NY 10031 USA

[2] Boston Univ, Dept Operat & Technol Management, Boston, MA 02215 USA

[3] Univ So Calif, Dept Ind & Syst Engn, Los Angeles, CA 90089 USA

来源：

PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES | 2008年 / 22卷 / 02期

关键词：

D O I：

10.1017/S0269964808000132

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider the classical coupon collector's problem in which each new coupon collected is type i with probability p(i); (i=1)Sigma(n) p(i)=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.

引用

页码：221 / 229

页数：9