Advertisement

Budgeted Competitive Influence Maximization on Online Social Networks

  • Canh V. PhamEmail author
  • Hieu V. Duong
  • Bao Q. Bui
  • My T. Thai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11280)

Abstract

Influence Maximization (\(\mathsf {IM}\)) is one of the key problems in viral marketing which has been paid much attention recently. Basically, \(\mathsf {IM}\) focuses on finding a set of k seed users on a social network to maximize the expected number of influenced nodes. However, most of related works consider only one player without competitors. In this paper, we investigate the Budgeted Competitive Influence Maximization (\({\mathsf {BCIM}}\)) problem within limited budget and time constraints which seeks a seed set nodes of a player or a company to propagate their products’s information while at the same time their competitors are conducting a similar strategy. We first analyze the complexity of this problem and show that the objective function is neither submodular nor suppermodular. We then apply Sandwich framework to design \({\mathsf {SPBA}}\), a randomized algorithm that guarantees a data dependent approximation factor.

Keywords

Social network Competitive Influence Maximization Approximation algorithm 

Notes

Acknowledgements

This work is partially supported by NSF EFRI 1441231 grant.

References

  1. 1.
    Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-77105-0_31CrossRefGoogle Scholar
  2. 2.
    Borgs, C., Brautbar, M., Chayes, J.T., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the ACM-SIAM, pp. 946–957 (2014)Google Scholar
  3. 3.
    Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model. Knowl. Based Syst. 134, 149–158 (2017)CrossRefGoogle Scholar
  4. 4.
    Chen, W., et al.: Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the SDM, pp. 379–390 (2011)CrossRefGoogle Scholar
  5. 5.
    Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2013)Google Scholar
  6. 6.
    Chung, F.R.K., Lu, L.: Survey: concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79–127 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the SDM, pp. 463–474 (2012)CrossRefGoogle Scholar
  8. 8.
    Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the KDD, pp. 137–146 (2003)Google Scholar
  9. 9.
    Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39–45 (1999)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: Proceedings of the KDD, pp. 420–429 (2007)Google Scholar
  11. 11.
    Liu, W., Yue, K., Wu, H., Li, J., Liu, D., Tang, D.: Containment of competitive influence spread in social networks. Knowl. Based Syst. 109, 266–275 (2016)CrossRefGoogle Scholar
  12. 12.
    Lu, W., Bonchi, F., Goyal, A., Lakshmanan, L.V.S.: The bang for the buck: fair competitive viral marketing from the host perspective. In: Proceedings of the KDD, pp. 928–936 (2013)Google Scholar
  13. 13.
    Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: comparative influence diffusion and maximization. PVLDB 9(2), 60–71 (2015)Google Scholar
  14. 14.
    Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the SIGMOD, pp. 695–710 (2016)Google Scholar
  15. 15.
    Nguyen, H.T., Thai, M.T., Dinh, T.N.: A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE/ACM Trans. Netw. 25(4), 2419–2429 (2017)CrossRefGoogle Scholar
  16. 16.
    Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the SIGMOD, pp. 1539–1554 (2015)Google Scholar
  17. 17.
    Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the SIGMOD, pp. 75–86 (2014)Google Scholar
  18. 18.
    Yan, R., Zhu, Y., Li, D., Ye, Z.: Minimum cost seed set for threshold influence problem under competitive models. World Wide Web (2018)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Canh V. Pham
    • 1
    • 2
    Email author
  • Hieu V. Duong
    • 2
  • Bao Q. Bui
    • 2
  • My T. Thai
    • 3
  1. 1.University of Engineering and Technology, Vietnam National UniversityHanoiViet Nam
  2. 2.Faculty of Information and SecurityPeople’s Security AcademyHanoiViet Nam
  3. 3.Department of Computer and Information Science and EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations