{"file":[{"checksum":"fe37fb9af3f5016c1084af9d6e7109bd","access_level":"open_access","date_created":"2021-07-01T11:21:40Z","date_updated":"2021-07-01T11:21:40Z","content_type":"application/pdf","file_name":"Population_Coupon_Collector.pdf","creator":"pdavies","file_id":"9621","relation":"main_file","file_size":319728}],"article_processing_charge":"No","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","department":[{"_id":"DaAl"}],"day":"20","publisher":"Springer Nature","date_created":"2021-07-01T11:04:43Z","file_date_updated":"2021-07-01T11:21:40Z","abstract":[{"lang":"eng","text":"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).\r\n\r\nWe 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."}],"volume":12810,"_id":"9620","oa":1,"publication":"Structural Information and Communication Complexity","language":[{"iso":"eng"}],"publication_status":"published","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"quality_controlled":"1","title":"Collecting coupons is faster with friends","citation":{"apa":"Alistarh, D.-A., &#38; Davies, P. (2021). Collecting coupons is faster with friends. In <i>Structural Information and Communication Complexity</i> (Vol. 12810, pp. 3–12). Wrocław, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">https://doi.org/10.1007/978-3-030-79527-6_1</a>","ista":"Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends. Structural Information and Communication Complexity.  SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.","chicago":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” In <i>Structural Information and Communication Complexity</i>, 12810:3–12. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">https://doi.org/10.1007/978-3-030-79527-6_1</a>.","ieee":"D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in <i>Structural Information and Communication Complexity</i>, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.","ama":"Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: <i>Structural Information and Communication Complexity</i>. Vol 12810. Springer Nature; 2021:3-12. doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">10.1007/978-3-030-79527-6_1</a>","mla":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” <i>Structural Information and Communication Complexity</i>, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">10.1007/978-3-030-79527-6_1</a>.","short":"D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12."},"date_published":"2021-06-20T00:00:00Z","intvolume":"     12810","year":"2021","ec_funded":1,"month":"06","publication_identifier":{"eisbn":["9783030795276"],"isbn":["9783030795269"],"issn":["0302-9743"],"eissn":["1611-3349"]},"author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","full_name":"Davies, Peter","last_name":"Davies","first_name":"Peter","orcid":"0000-0002-5646-9524"}],"conference":{"name":" SIROCCO: International Colloquium on Structural Information and Communication Complexity","end_date":"2021-07-01","start_date":"2021-06-28","location":"Wrocław, Poland"},"status":"public","date_updated":"2023-02-23T14:02:46Z","oa_version":"Preprint","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-79527-6_1","page":"3-12","has_accepted_license":"1","type":"conference","ddc":["000"],"acknowledgement":"Peter Davies is supported by the European Union’s Horizon2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411."}