arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.00531cs.SIcs.DB
收藏

激励式社交广告中的收入最大化

Revenue Maximization in Incentivized Social Advertising

Cigdem Aslay, Francesco Bonchi, Laks V. S. Lakshmanan, Wei Lu

摘要:

激励式社交广告是一种新兴的营销模式,它不仅为社交网络平台的所有者,而且还通过提供广告收入的“削减”来为他们的有影响力的用户提供货币化机会。我们考虑一个社交网络(主机),它通过将广告以推广帖子的形式插入到精心挑选的“初始代言人”或种子用户的提要中来向广告商出售广告参与:这些用户获得金钱激励以换取他们的代言。代言帮助广告传播到他们的追随者的饲料。在这种情况下,主机的问题是将广告分配给有影响力的用户,考虑到广告的病毒传播倾向,并在对有影响力的用户的激励和广告参与成本之间仔细分配每个广告客户的货币预算,以最大化其自身收入的理性目标。我们认为,有影响力的用户,这是成比例的影响潜力的货币激励。我们发现,在激励社会广告的收入最大化对应于单调子模块函数最大化的问题,受分区拟阵约束的广告种子分配,和子模块背包约束的广告客户的预算。这个问题是NP难的,我们设计了2个贪心算法与可证明的近似保证,不同的种子用户激励成本的敏感性。我们的近似算法需要反复估计预期的边际收益的收入以及广告客户支付。通过利用连接到预期的影响力传播的可扩展估计的最新进展,我们设计了有效的和可扩展的版本的贪心算法。

英文摘要:

Incentivized social advertising, an emerging marketing model, provides monetization opportunities not only to the owners of the social networking platforms but also to their influential users by offering a "cut" on the advertising revenue. We consider a social network (the host) that sells ad-engagements to advertisers by inserting their ads, in the form of promoted posts, into the feeds of carefully selected "initial endorsers" or seed users: these users receive monetary incentives in exchange for their endorsements. The endorsements help propagate the ads to the feeds of their followers. In this context, the problem for the host is is to allocate ads to influential users, taking into account the propensity of ads for viral propagation, and carefully apportioning the monetary budget of each of the advertisers between incentives to influential users and ad-engagement costs, with the rational goal of maximizing its own revenue. We consider a monetary incentive for the influential users, which is proportional to their influence potential. We show that revenue maximization in incentivized social advertising corresponds to the problem of monotone submodular function maximization, subject to a partition matroid constraint on the ads-to-seeds allocation, and submodular knapsack constraints on the advertisers' budgets. This problem is NP-hard and we devise 2 greedy algorithms with provable approximation guarantees, which differ in their sensitivity to seed user incentive costs. Our approximation algorithms require repeatedly estimating the expected marginal gain in revenue as well as in advertiser payment. By exploiting a connection to the recent advances made in scalable estimation of expected influence spread, we devise efficient and scalable versions of the greedy algorithms.

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

↑