Abstract
We consider an extension of the well-known coupon collecting (CC) problem. In our model we have a player who is allowed to deterministically select one box per time step. The player plays against a random sequence of box choices r 1,r 2,… In each step, the contents of both boxes are merged.
The goal of the player is to collect all coupons in one box (the standard model), or to have a copy of each coupon in all boxes. We consider three information models, depending on the knowledge of the random choices that the player has before he has to fix his deterministic choices: (i) full prior knowledge of the whole random sequence; (ii) knowledge of the random sequence up to the previous step (but not the current or any subsequent step); (iii) all decisions must be made in advance without any knowledge of the random sequence.
Our main results are lower and asymptotically matching constructive upper bounds for all three models. We also show that network gossiping (similar in spirit to all-in-all CC) is asymptotically no harder than collecting coupons.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced Allocations. SIAM Journal on Computing 29(1), 180–200 (1999)
Alistarh, D., Gilbert, S., Guerraoui, R., Zadimoghaddam, M.: How efficient can gossip be (On the cost of resilient information exchange). In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 115–126. Springer, Heidelberg (2010)
Berenbrink, P., Elsässer, R., Friedetzky, T.: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In: Proc. of PODC 2008, pp. 155–164 (2008)
Berenbrink, P., Czyzowicz, J., Elsässer, R., Gasieniec, L.: Efficient information exchange in the random phone-call model (2010) (manuscript)
Chen, J., Pandurangan, G.: Optimal Gossip-Based Aggregate Computation. To appear in Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2010)
Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic Algorithms for Replicated Database Maintenance. In: Proc. 6th ACM Symposium on Principles of Distributed Computing, PODC 1987, pp. 1–12 (1987)
Elsässer, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: Proc. of SODA 2008, pp. 290–227 (2008)
Elsässer, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proc. of SPAA 2006, pp. 148–157 (2006)
Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized Broadcast in Networks. Random Structures and Algorithms 1(4), 447–460 (1990)
Fernandess, Y., Malkhi, D.: On collaborative content distribution using multi-message gossip. Journal of Parallel and Distributed Computing 12, 1232–1239 (2007)
Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: Proc. of FOCS 2000, pp. 565–574 (2000)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of FOCS 2003, pp. 482–491 (2003)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambdrige University Press, Cambdrige (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Berenbrink, P., Elsässer, R., Friedetzky, T., Nagel, L., Sauerwald, T. (2011). Faster Coupon Collecting via Replication with Applications in Gossiping. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-22993-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22992-3
Online ISBN: 978-3-642-22993-0
eBook Packages: Computer ScienceComputer Science (R0)