The Hypergeometric Coupon Collection Problem and its Dual
نویسندگان
1 Epstein Department of Industrial and Systems Engineering , University of Southern California, Los Angeles, CA, USA
doi
چکیده
Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all of the balls of at least one type.
