Coupon subset collection problem with quotas

DOI10.1007/S11009-020-09811-ZzbMATH Open1477.60028OpenAlexW3045601488MaRDI QIDQ2065461FDOQ2065461

Authors: Shigeo Shioda 

Publication date: 7 January 2022

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-020-09811-z

Recommendations

• The coupon subset collection problem
• A coupon collector's problem with bonuses
• Coupon collecting with quotas
• THE MULTIPLE SUBSET COUPON COLLECTING PROBLEM
• A generalized coupon collector problem

zbMATH Keywords

survival functionboundcombinatorial probabilityrandom testingcoupon collection problem

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial inequalities (05A20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Coupon collecting with quotas
• The coupon subset collection problem
• Some bounds on the coupon collector problem
• On Birthday, Collectors', Occupancy and Other Classical Urn Problems
• Some New Aspects of the Coupon Collector's Problem
• Generalized coupon collection: the superlinear case
• The collector's problem with group drawings
• A survey of the coupon collector's problem with random sample sizes
• Asymptotics for the random coupon collector problem
• Extreme value distributions for random coupon collector and birthday problems
• General asymptotic estimates for the coupon collector problem
• Some upper and lower bounds on the coupon collector problem
• Quota fulfillment times
• Coupon collector problem for non-uniform coupons and random quotas
• Trade-offs in probabilistic packet marking for IP traceback

Cited In (3)

• Optimal strategy of coupon subset collection when each package contains half of the coupons
• The coupon subset collection problem
• THE MULTIPLE SUBSET COUPON COLLECTING PROBLEM

This page was built for publication: Coupon subset collection problem with quotas

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