Collecting coupons is faster with friends

DOI10.1007/978-3-030-79527-6_1OpenAlexW3176934757MaRDI QIDQ2117703FDOQ2117703

Authors: Dan Alistarh, P. Davies 

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2112.05830

Recommendations

• COUPON COLLECTING
• Coupon collecting with quotas
• Applied Cryptography and Network Security
• The siblings of the coupon collector
• Optimality results for coupon collection
• A coupon collector's problem with bonuses
• A variation on the coupon collecting problem
• Group‐buying coupons considering consumers’ perceived ease of use

zbMATH Keywords

probabilitypopulation protocolscoupon collector problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Double Dixie Cup Problem
• Title not available (Why is that?)
• The siblings of the coupon collector

Cited In (1)

• Collecting Coupons is Faster with Friends

This page was built for publication: Collecting coupons is faster with friends

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