Algorithms for Online Influencer Marketing

Article, Preprint English OPEN
Lagrée, Paul; Cappé, Olivier; Cautis, Bogdan; Maniu, Silviu;
(2019)
  • Publisher: ACM
  • Related identifiers: doi: 10.1145/3274670
  • Subject: [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI] | CCS Concepts:• Computing methodologies → Sequential decision making | Influencer marketing | Computer Science - Social and Information Networks | Data mining | Online social networks | Influence maximization | CCS Concepts: • Information systems → Social advertising | Multi-armed bandits | Information diffusion | Online learning

Influence maximization is the problem of finding influential users, or nodes, in a graph so as to maximize the spread of information. It has many applications in advertising and marketing on social networks. In this paper, we study a highly generic version of influence ... View more
  • References (43)
    43 references, page 1 of 5

    [1] In D. Brown and N. Hayes, editors, Influencer Marketing . Butterworth-Heinemann, Oxford, 2008.

    [2] A. Arora, S. Galhotra, and S. Ranu. Debunking the myths of influence maximization: An in-depth benchmarking study. In SIGMOD. ACM, 2017.

    [3] N. Barbieri, F. Bonchi, and G. Manco. Topic-aware social influence propagation models. Knowl. Inf. Syst., 37(3):555-584, 2013.

    [4] N. Barbieri, F. Bonchi, and G. Manco. Eficient methods for influence-based network-oblivious community detection. ACM TIST, 8(2), 2017.

    [5] D. Berend and A. Kontorovich. On the concentration of the missing mass. In Electronic Communications in Probability, pages 1-7, 2013.

    [6] S. Boucheron, G. Lugosi, P. Massart, and M. Ledoux. Concentration inequalities : a nonasymptotic theory of independence. Oxford university press, 2013.

    [7] D. Brown and S. Fiorella. Influence Marketing: How to Create, Manage, and Measure Brand Influencers in Social Media Marketing. Always learning. Que, 2013.

    [8] S. Bubeck and N. Cesa-Bianchi. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations & Trends in ML, 2012.

    [9] S. Bubeck, D. Ernst, and A. Garivier. Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality. Journal of Machine Learning Research, 14(1):601-623, 2013.

    [10] W. Chen, T. Lin, Z. Tan, M. Zhao, and X. Zhou. Robust influence maximization. In SIGKDD, pages 795-804, 2016.

  • Related Research Results (1)
  • Metrics
Share - Bookmark