Some bounds on the coupon collector problem with universal coupon

Abstract

We consider a generalization of the coupon collector problem with unequal probabilities, such that there are two additional coupons in the coupon set: one that speeds up the coupon collection process, and the one that slows it down. We derive some upper and lower bounds on the distribution function of the waiting time until a subcollection or a full collection of coupons is sampled.

Keywords

• coupon collector problem
• waiting time
• universal coupon
• schur-convexity
• bounds
• primary 60c05