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

DOI10.1016/J.IPL.2014.06.012zbMATH Open1371.60030OpenAlexW2018530885MaRDI QIDQ402372FDOQ402372

Authors: 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

Recommendations

• Optimality results for coupon collection
• The coupon subset collection problem
• A variation on the coupon collecting problem
• Coupon subset collection problem with quotas
• THE MULTIPLE SUBSET COUPON COLLECTING PROBLEM

zbMATH Keywords

experimental designdistributed algorithmscombinatorial problemsprobabilistic methodcoupon subset collection

Mathematics Subject Classification ID

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

Cites Work

• The sampling theory of selectively neutral alleles
• 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 coupon-collector problem revisited — a survey of engineering problems and computational methods
• The collector's problem with group drawings

Cited In (1)

• Results and conjectures on the role of the uniform distribution in the coupon 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402372)