A Variation on the Coupon Collecting Problem

The classical coupon collector's problem is considered, where each new coupon collected is type i with probability p_i , ∑ ⁿ _{i = 1} p_i = 1. Suppose coupons are collected in a sequence of independent trials. An expression is developed for the probability that all coupon types i, i ≠ j, have been collected prior to collecting r ? 1 coupons of type j in the sequence of trials. Given two different coupon subsets A, B of {1, 2, …, n}, the foregoing is then generalized to an expression for the probability that s ? 1 copies of A appear in the sequence of trials before r ? 1 copies of B. Some computational considerations are discussed.