Collecting Coupons is Faster with Friends

12/10/2021
by   Dan Alistarh, et al.
0

In this note, we introduce a distributed twist on the classic coupon collector problem: a set of m collectors wish to each obtain a set of n coupons; for this, they can each sample coupons uniformly at random, but can also meet in pairwise interactions, during which they can exchange coupons. By doing so, they hope to reduce the number of coupons that must be sampled by each collector in order to obtain a full set. This extension is natural when considering real-world manifestations of the coupon collector phenomenon, and has been remarked upon and studied empirically [Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019]. We provide the first theoretical analysis for such a scenario. We find that "coupon collecting with friends" can indeed significantly reduce the number of coupons each collector must sample, and raises interesting connections to the more traditional variants of the problem. While our analysis is in most cases asymptotically tight, there are several open questions raised, regarding finer-grained analysis of both "coupon collecting with friends", and of a long-studied variant of the original problem in which a collector requires multiple full sets of coupons.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2020

Simple and sharp analysis of k-means||

We present a truly simple analysis of k-means|| (Bahmani et al., PVLDB 2...
research
08/19/2022

Secretary Problems: The Power of a Single Sample

In this paper, we investigate two variants of the secretary problem. In ...
research
10/30/2019

On a Decentralized (Δ+1)-Graph Coloring Algorithm

We consider a decentralized graph coloring model where each vertex only ...
research
08/29/2013

Collecting Coupons with Random Initial Stake

Motivated by a problem in the theory of randomized search heuristics, we...
research
06/03/2021

Optimal sets of questions for Twenty Questions

In the distributional Twenty Questions game, Bob chooses a number x from...
research
08/02/2022

Bias Reduction for Sum Estimation

In classical statistics and distribution testing, it is often assumed th...
research
03/22/2022

Adaptative clustering by minimization of the mixing entropy criterion

We present a clustering method and provide a theoretical analysis and an...

Please sign up or login with your details

Forgot password? Click here to reset