The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
Discrete Mathematics
2025-02-06 v1
Abstract
We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their matching labels. We show two extra-extensions to this variation: the heterogeneous sample size case (K-LCCP) and the partly recovering case.
Cite
@article{arxiv.2502.02968,
title = {The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery},
author = {Shoham Shimon Berrebi and Eitan Yaakobi and Zohar Yakhini and Daniella Bar-Lev},
journal= {arXiv preprint arXiv:2502.02968},
year = {2025}
}