Viral marketing meets social advertising

作者: Cigdem Aslay , Wei Lu , Francesco Bonchi , Amit Goyal , Laks V. S. Lakshmanan

DOI: 10.14778/2752939.2752950

关键词: Social networkContext (language use)Viral marketingRegretAdvertisingComputer scienceHost (network)

摘要: Social advertisement is one of the fastest growing sectors in digital landscape: ads form promoted posts are shown feed users a social networking platform, along with normal posts; if user clicks on post, host (social network owner) paid fixed amount from advertiser. In this context, allocating to typically performed by maximizing click-through-rate, i.e., likelihood that will click ad. However, simple strategy fails leverage fact can propagate virally through network, endorsing their followers.In paper, we study problem viral-marketing lenses. We show allocation takes into account propensity for viral propagation achieve significantly better performance. uncontrolled virality could be undesirable as it creates room exploitation advertisers: hoping tap virality, an advertiser might declare lower budget its marketing campaign, aiming at same large outcome smaller cost.This challenging trade-off: hand, aims leveraging and effect improve advertising efficacy, while other hand wants avoid giving away free service due virality. formalize ad minimum regret, which NP-hard inapproximable w.r.t. any factor. devise algorithm provides approximation guarantees total all advertisers. develop scalable version our algorithm, extensively test four real-world data sets, confirming delivers high quality solutions, scalable, outperforms several natural baselines.

参考文章(25)
Jon Feldman, Nitish Korula, Vahab Mirrokni, S. Muthukrishnan, Martin Pál, Online Ad Assignment with Free Disposal Lecture Notes in Computer Science. pp. 374- 385 ,(2009) , 10.1007/978-3-642-10841-9_34
Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Cliff Stein, Online stochastic packing applied to display ad allocation european symposium on algorithms. pp. 182- 194 ,(2010) , 10.1007/978-3-642-15775-2_16
G. L. Nemhauser, L. A. Wolsey, M. L. Fisher, An analysis of approximations for maximizing submodular set functions--I Mathematical Programming. ,vol. 14, pp. 265- 294 ,(1978) , 10.1007/BF01588971
Le Song, Yingyu Liang, Maria Florina Balcan, Nan Du, Budgeted Influence Maximization for Multiple Products arXiv: Learning. ,(2013)
Morteza Zadimoghaddam, Shayan Oveis Gharan, Vahab S. Mirrokni, Simultaneous approximations for adversarial and stochastic online budgeted allocation symposium on discrete algorithms. pp. 1690- 1701 ,(2012) , 10.5555/2095116.2095250
David M Blei, Andrew Y Ng, Michael I Jordan, None, Latent dirichlet allocation Journal of Machine Learning Research. ,vol. 3, pp. 993- 1022 ,(2003) , 10.5555/944919.944937
Wei Chen, Chi Wang, Yajun Wang, Scalable influence maximization for prevalent viral marketing in large-scale social networks knowledge discovery and data mining. pp. 1029- 1038 ,(2010) , 10.1145/1835804.1835934
Amit Goyal, Francesco Bonchi, Laks V. S. Lakshmanan, A data-based approach to social influence maximization Proceedings of the VLDB Endowment. ,vol. 5, pp. 73- 84 ,(2011) , 10.14778/2047485.2047492
Gagan Goel, Aranyak Mehta, Online budgeted matching in random input models with applications to Adwords symposium on discrete algorithms. pp. 982- 991 ,(2008)