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

协调社交网络广告活动的近似算法

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks

Kartik Lakhotia, David Kempe

摘要:

我们研究了一个自然的模型,协调的社会广告活动在社会网络上,模型的基础上Datta等。和Aslay等。多个广告客户愿意支付主机-高达已知的预算-每个用户曝光,无论曝光赞助或orgain(即由朋友分享)。广告系列会向某些用户植入赞助广告,但任何用户都不能接触太多赞助广告。因此,虽然广告活动在网络上独立进行,但它们需要就其种子集进行仔细协调。我们研究的目标是最大化主机的总广告收入。我们的主要结果是表明,在广泛的一类影响模型,问题可以减少到最大限度地提高submodular功能受到两个拟阵约束,因此,它可以近似在一个因素基本上1/2的多项式时间。当广告商的个体种子集大小没有约束时,约束仅对应于单个拟阵,并且保证可以提高到1-1/e;在这种情况下,通过实用的贪心算法实现因子1/2。拟阵约束问题的1-1/e近似算法远不实用;然而,我们表明,特别是在独立级联模型下,LP舍入和反向可达性技术可以结合起来,以获得1-1/e近似算法。我们的理论研究结果的补充实验评估在何种程度上的协调多个广告活动抑制从每个单独的活动中获得的收入,作为一个功能的相似性的影响力网络和网络中的关系的强度。我们的实验表明,随着不同广告商的网络变得越来越不相似,竞争的有害影响也会减少。关于领带强度,我们表明,最大的伤害是在一个中间范围。

英文摘要:

We study a natural model of coordinated social ad campaigns over a social network, based on models of Datta et al. and Aslay et al. Multiple advertisers are willing to pay the host - up to a known budget - per user exposure, whether the exposure is sponsored or orgain (i.e. shared by a friend). Campaigns are seeded with sponsored ads to some users, but no user must be exposed to too many sponsored ads. Thus, while ad campaigns proceed independently over the network, they need to be carefully coordinated with respect to their seed sets. We study the objective of maximizing host's total ad revenue. Our main result is to show that under a broad class of influence models, the problem can be reduced to maximizing a submodular function subject to two matroid constraints; it can therefore be approximated within a factor essentially 1/2 in polynomial time. When there is no bound on the individual seed set sizes of advertisers, the constraints correspond only to a single matroid, and the guarantee can be improved to 1-1/e; in that case, a factor 1/2 is achieved by a practical greedy algorithm. The 1-1/e approximation algorithm for matroid-constrained problem is far from practical; however, we show that specifically under the Independent Cascade model, LP rounding and Reverse Reachability techniques can be combined to obtain a 1-1/e approximation algorithm. Our theoretical results are complemented by experiments evaluating the extent to which the coordination of multiple ad campaigns inhibits the revenue obtained from each individual campaign, as a function of the similarity of the influence networks and strength of ties in the networks. Our experiments suggest that as networks for different advertisers become less similar, the harmful effect of competition decreases. With respect to tie strengths, we show that the most harm is done in an intermediate range.

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

↑