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

带预算的最大信息传播

Maximal Information Propagation with Budgets

Haomin Shi, Yao Zhang, Zilin Si, Letong Wang, Dengji Zhao

摘要:

在本文中,我们提出了一个网络上的信息传播游戏,其中的信息是来自赞助商谁愿意支付一个固定的总预算的球员谁传播的信息。我们的解决方案可以应用于现实世界的情况下,如广告通过社交网络有限的预算。我们的目标是设计一种分配预算的机制,以激励社交网络中的所有参与者将信息传播给所有邻居。我们提出了一个家庭的机制来实现这一目标,传播信息到所有的邻居是一个占主导地位的战略,为所有的球员。此外,我们还考虑了预算必须完全分摊的情况。

英文摘要:

In this paper, we present an information propagation game on a network where the information is originated from a sponsor who is willing to pay a fixed total budget to the players who propagate the information. Our solution can be applied to real world situations such as advertising via social networks with limited budgets. The goal is to design a mechanism to distribute the budget such that all players in the social network are incentivized to propagate information to all their neighbours. We propose a family of mechanisms to achieve the goal, where propagating information to all neighbours is a dominant strategy for all players. Furthermore, we also consider the cases where the budget has to be completely shared.

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

↑