arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.05209cs.SIphysics.soc-ph
收藏

社交网络中的成本效益营销

Cost Effective Campaigning in Social Networks

Bhushan Kotnis, Joy Kuri

摘要:

活动家越来越多地使用在线社交网络平台来宣传产品、想法和信息。推广产品甚至想法的一种流行方法是激励个人大力宣传这个想法,为他们提供折扣,现金返还或社会认可等形式的推荐奖励。由于资金和人力等稀缺资源的预算限制,可能无法为所有人提供奖励,因此需要明智地将奖励分配给适当的个人,以确保尽可能扩大外联规模。我们的目标是通过使用渗流理论制定和解决优化问题来做同样的事情。特别是,我们计算的一组个人提供的激励措施,以尽量减少预期成本,同时确保一个给定的推广规模。我们还解决了计算一组个人的激励最大化的推广规模给定的成本预算的问题。事实证明,优化问题并不平凡;它涉及需要通过数值求解不动点方程来计算的量。我们的主要贡献是,对于一个相当一般的成本结构,我们表明,优化问题可以解决一个简单的线性规划。我们相信,我们的方法使用渗流理论制定的优化问题是第一次。

英文摘要:

Campaigners are increasingly using online social networking platforms for promoting products, ideas and information. A popular method of promoting a product or even an idea is incentivizing individuals to evangelize the idea vigorously by providing them with referral rewards in the form of discounts, cash backs, or social recognition. Due to budget constraints on scarce resources such as money and manpower, it may not be possible to provide incentives for the entire population, and hence incentives need to be allocated judiciously to appropriate individuals for ensuring the highest possible outreach size. We aim to do the same by formulating and solving an optimization problem using percolation theory. In particular, we compute the set of individuals that are provided incentives for minimizing the expected cost while ensuring a given outreach size. We also solve the problem of computing the set of individuals to be incentivized for maximizing the outreach size for given cost budget. The optimization problem turns out to be non trivial; it involves quantities that need to be computed by numerically solving a fixed point equation. Our primary contribution is, that for a fairly general cost structure, we show that the optimization problems can be solved by solving a simple linear program. We believe that our approach of using percolation theory to formulate an optimization problem is the first of its kind.

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

↑