Coupons collecting with or without replacement, and with multipurpose coupons
classification
🧮 math.PR
cs.DM
keywords
couponsalgorithmbasiccenterpiececertainclassiccollectingcounts
read the original abstract
The classic Coupon-Collector Problem (CCP) is generalized to the extent that each coupons serves certain "purposes". Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all $k$-element transversals of a set system.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.