Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 165

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

A Framework for Analyzing Influencer Marketing in Social Networks: Selection and Scheduling of Influencers

Open access
Mallipeddi, Rakesh R., Kumar, Subodha, Sriskandarajah, Chelliah, Zhu, Yunxia · 2022 · Management Science

Abstract

Explosive growth in the number of users on various social media platforms has transformed the way firms strategize their marketing activities. To take advantage of the vast size of social networks, firms have now turned their attention to influencer marketing wherein they employ independent influencers to promote their products on social media platforms. Despite the recent growth in influencer marketing, the problem of network seeding (i.e., identification of influencers to optimally post a firm’s message or advertisement) neither has been rigorously studied in the academic literature nor has been carefully addressed in practice. We develop a data-driven optimization framework to help a firm successfully conduct (i) short-horizon and (ii) long-horizon influencer marketing campaigns, for which two models are developed, respectively, to maximize the firm’s benefit. The models are based on the interactions with marketers, observation of firms’ message placements on social media, and model parameters estimated via empirical analysis performed on data from Twitter. Our empirical analysis discovers the effects of collective influence of multiple influencers and finds two important parameters to be included in the models, namely, multiple exposure effect and forgetting effect. For the short-horizon campaign, we develop an optimization model to select influencers and present structural properties for the model. Using these properties, we develop a mathematical programming based polynomial time procedure to provide near-optimal solutions. For the long-horizon problem, we develop an efficient solution procedure to simultaneously select influencers and schedule their message postings over a planning horizon. We demonstrate the superiority of our solution strategies for both short- and long-horizon problems against multiple benchmark methods used in practice. Finally, we present several managerially relevant insights for firms in the influencer marketing context. This paper was accepted by J. George Shanthikumar, big data analytics.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/mnsc.2020.3899

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 43

  1. 10.1017/nws.2013.6 · DOI
  2. Bharathi S, Kempe D, Salek M 2007. Competitive influence maximization in social networks. Internat. Workshop on Web and Internet Economics (Springer, Berlin), 306–311. · doi:10.1007/978-3-540-77105-0_31
  3. 10.1287/opre.1040.0119 · doi:10.1287/opre.1040.0119
  4. Bradley S, 1977, Applied Mathematical Programming
  5. 10.1287/opre.50.6.946.351 · DOI
  6. 10.1287/mnsc.2015.2312 · DOI
  7. 10.1016/S0305-0548(99)00074-X · DOI · Paper page
  8. 10.1287/mksc.22.4.520.24906 · DOI · Paper page
  9. Chen W, Wang C, Wang Y (2010a) Scalable influence maximization for prevalent viral marketing in large-scale social networks. Proc. 16th ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining (ACM, New York), 1029–1038. · DOI · Paper page
  10. Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. Proc. 15th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining (ACM, New York), 199–208. · DOI · Paper page
  11. Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. 2010 IEEE Internat. Conf. on Data Mining (IEEE, New York), 88–97. · DOI · Paper page
  12. Chen W, Collins A, Cummings R, Ke T, Liu Z, Rincon D, Sun X, (2011) Influence maximization in social networks when negative opinions may emerge and propagate. Proc. of the 2011 SIAM Internat. Conf. on Data Mining (SIAM, Philadelphia), 379–390. · DOI · Paper page
  13. 10.1287/isre.1070.0147 · DOI
  14. Domingos P, Richardson M (2001) Mining the network value of customers. Proc. 7th ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining (ACM, New York), 57–66. · DOI · Paper page
  15. 10.1287/isre.1120.0461 · DOI
  16. Garey MR, 1979, Computers and Intractability: A Guide to NP-Completeness
  17. Gelper S, 2020, Management S
  18. 10.1111/poms.12521 · DOI
  19. Goyal A, Bonchi F, Lakshmanan LVS (2010) Learning influence probabilities in social networks. Proc. 3rd ACM Internat. Conf. on Web Search and Data Mining (ACM, New York), 241–250. · DOI · Paper page
  20. He X, Kempe D (2016) Robust influence maximization. Proc. 22nd ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining (ACM, New York), 795–804. · doi:10.1145/2939672.2939760
  21. 10.7551/mitpress/1090.001.0001 · DOI · Paper page
  22. 10.1177/0022242918805411 · DOI · Paper page
  23. Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. Proc. 9th ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining (ACM New York), 137–146. · DOI · Paper page
  24. 10.1287/isre.2019.0836 · DOI · Paper page
  25. Kumar S, 2015, Optimization Issues in Web and Mobile Advertising: Past and Future Trends
  26. 10.1287/isre.2017.0749 · DOI · Paper page
  27. 10.1109/TKDE.2007.190640 · DOI
  28. 10.1016/j.ejor.2005.07.005 · DOI
  29. 10.1287/mksc.2017.1062 · DOI
  30. Li G, Chen S, Feng J, Tan K, Li W 2014. Efficient location-aware influence maximization. Proc. 2014 ACM SIGMOD Internat. Conf. on Management of Data (ACM, New York), 87–98. · DOI
  31. 10.1287/isre.2020.0961 · DOI
  32. 10.1177/002224379703400205 · DOI · Paper page
  33. 10.1287/opre.2016.1553 · DOI
  34. 10.1109/JSAC.2013.130610 · DOI
  35. 10.1287/mnsc.2020.3740 · DOI
  36. 10.1287/isre.2016.0679 · DOI
  37. 10.1080/10496491.2016.1154921 · DOI
  38. 10.1111/j.1540-5915.1985.tb01490.x · doi:10.1111/j.1540-5915.1985.tb01490.x
  39. Suh B, Hong L, Pirolli P, Chi EH (2010) Want to be retweeted? Large scale analytics on factors impacting retweet in twitter network. Proc. IEEE 2nd Internat. Conf. on Social Computing (IEEE, New York), 177–184. · DOI · Paper page
  40. 10.1287/isre.2017.0697 · DOI
  41. Tellis GJ, 1997, J. Advertising Res., 37, 75
  42. 10.1007/BF00175354 · DOI · Paper page
  43. Zhuang H, Sun Y, Tang J, Zhang J, Sun X (2013) Influence maximization in dynamic social networks. Proc. IEEE 13th Internat. Conf. on Data Mining (IEEE, New York), 1313–1318. · doi:10.1109/icdm.2013.145

Cited by

See all 165

Metadata

Authors
Mallipeddi, R. R., Kumar, S., Sriskandarajah, C., & Zhu, Y.
Venue
Management Science
Published
2022-01
Volume
68
Issue
1
Pages
75-104
ISSN
  • 0025-1909 (ISSN-L)
  • 1526-5501
OpenAlex
W3132246426
Cited by
165
References
3
FWCI
7.97
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.