arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0912.2523cs.DM
收藏

合作多人优惠券收集者问题的马尔可夫模型

Markov Modeling of Cooperative Multiplayer Coupon Collectors' Problems

R. Rovatti, C. Passerini, G. Mazzini

摘要:

本文介绍了一个经典的优惠券收藏家的问题,需要多个玩家之间的交流和合作的修改版本。开发结果表明,在适当的马尔可夫框架内,合作的多人优惠券收集者的问题的复杂性,可以攻击着眼于下一代网络的背景下的资源收集和共享的建模。合作的成本计算方面的交换协议的负担,发现是依赖于合奏参数,如玩家的数量和优惠券的数量,但不详细的收集统计。合作的好处是量化的,减少了在收集完成之前的平均行动次数。

英文摘要:

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 resource harvesting and sharing within the context of Next Generation Network. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑