Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Asymptotics for the random coupon collector problem
Journal of Computational and Applied Mathematics
Some New Aspects of the Coupon Collector's Problem
SIAM Journal on Discrete Mathematics
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Tabu marking scheme to speedup IP traceback
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Architectural Framework for Accurate Characterization of Network Traffic
IEEE Transactions on Parallel and Distributed Systems
Efficient prediction of Marsaglia-Zaman random number generators
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The paper introduces a modified version of the classical Coupon Collector's Problem entailing exchanges and cooperation between multiple players. Results of the development show that, within a proper Markov framework, the complexity of the Cooperative Multiplayer Coupon Collectors' Problem can be attacked with an eye to the modeling of social strategies and community behaviors. The cost of cooperation is computed in terms of exchange protocol burden and found to be dependent on only ensemble parameters such as the number of players and the number of coupons but not on the detailed collection statistics. The benefits of cooperation are quantified in terms of reduction of the average number of actions before collection completion.