Optimal strategy of coupon subset collection when each package contains half of the coupons

DOI10.1016/j.ipl.2014.06.012zbMath1371.60030OpenAlexW2018530885MaRDI QIDQ402372

Chengfang Fang, Ee-Chien Chang

Publication date: 28 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.012

zbMATH Keywords

combinatorial problemsprobabilistic methoddistributed algorithmsexperimental designcoupon subset collection

Mathematics Subject Classification ID

Combinatorial probability (60C05) Distributed algorithms (68W15)

Related Items (1)

Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings

Cites Work

• A new approach to the analysis of random methods for detecting necessary linear inequality constraints
• On the best case performance of hit and run methods for detecting necessary constraints
• Optimal inter-object correlation when replicating for availability
• The sampling theory of selectively neutral alleles
• The coupon-collector problem revisited — a survey of engineering problems and computational methods
• The collector's problem with group drawings

This page was built for publication: Optimal strategy of coupon subset collection when each package contains half of the coupons