skip to main content
research-article

Managing Conflicting Interests of Stakeholders in Influencer Marketing

Published: 30 May 2023 Publication History

Abstract

A successful campaign should be able to attract investment from the brand, and meanwhile manage the conflicting interests in the campaign cost between the brand and the influencers. As such, the agency between these two stakeholders plays a vital role. Motivated by the above, we stand in the agency's shoes to formulate an interesting yet practical problem, namely Profit Divergence Minimization in Investment-Persuasive Influencer Marketing Campaign (PDMIC). This problem aims to (i) minimize the divergence of the actual hiring prices from the asking prices of the influencers and meanwhile (ii) maintain the attractiveness of the pricing scheme for the influencers to the brand. We show that this problem is NP-hard. To mitigate the challenge of the extremely large searching space of the hiring prices of the influencers, we solve this problem by firstly considering a restrictive searching sub-space and then gradually expanding the searching sub-space to the whole space in the end (specifically, from binary price choices to a set of integer prices and then to any price in the feasible price range). We propose effective yet efficient approximate algorithms for solving the problem in each of these settings. Extensive experiments demonstrate the superiority of our methods.

Supplemental Material

MP4 File
Presentation video for SIGMOD 2023

References

[1]
2009. https://courses.engr.illinois.edu/cs598csc/sp2009/lectures/lecture_4.pdf.
[2]
2016. https://resource.co/article/material-gains-through-brokerage-services-11506.
[3]
2017. https://www.emarketer.com/Article/Influencer-Marketing-Prices-Rising-UK/1016283.
[4]
2019. https://buffer.com/resources/micro-influencers/.
[5]
2019. https://later.com/blog/instagram-influencers-costs/.
[6]
2019. https://bondai.co/blog/6-types-of-influencers/.
[7]
2020. https://socialpubli.com/blog/how-influencer-agency-work/.
[8]
2020. https://influencermarketinghub.com/micro-influencers-vs-celebrities/.
[9]
2020. https://www.oracle.com/a/ocom/docs/cloud/oracle-451-research-advisory-blog-adopting.pdf.
[10]
2020. https://reusewood.org/guide/material-brokerage.
[11]
2020. https://blog.planoly.com/calculate-influencer-rates.
[12]
2021. https://www.marketingdive.com/news/social-commerce-drive-influencer-marketing-evolution-2022/611546/.
[13]
2021. https://www.forbes.com/sites/forbesagencycouncil/2021/06/02/micro-influencers-when-smaller-is-better/'sh= 591ee7d1539b.
[14]
2021. https://www.marketingcharts.com/digital/social-media-116631.
[15]
2021. https://www.indeed.com/career-advice/career-development/tiered-pricing-template.
[16]
2021. https://www.businessofapps.com/marketplace/influencer-marketing/research/influencer-marketing-costs/.
[17]
2021. https://blog.hootsuite.com/instagram-influencer-rates//.
[18]
2021. https://hashtagpaid.com/banknotes/creator-rates.
[19]
2022. https://fourthfloorcreative.co/blog/influencer-marketing-agency.
[20]
2022. https://winkmodels.com.au/much-cost-book-influencer/.
[21]
2022. https://www.britannica.com/topic/operations-research/Resource-allocation.
[22]
2022. https://quickbooks.intuit.com/r/midsize-business/tiered-pricing/.
[23]
2022. https://blog.axway.com/learning-center/cloud-adoption/multi-cloud-strategy.
[24]
2022. https://gitfront.io/r/user-9366410/jA9cWP7WK7Dg/master/.
[25]
2022. https://www.andrewmacarthy.com/andrew-macarthy-social-media/instagram-influencer-pricing.
[26]
2022. https://www.webfx.com/influencer-marketing-pricing.html.
[27]
Akhil Arora, Sainyam Galhotra, and Sayan Ranu. 2017. Debunking the myths of influence maximization: An in-depth benchmarking study. In SIGMOD. 651--666.
[28]
David Arthur, Rajeev Motwani, Aneesh Sharma, and Ying Xu. 2009. Pricing strategies for viral marketing on social networks. In International workshop on internet and network economics. 101--112.
[29]
Çigdem Aslay, Francesco Bonchi, Laks V. S. Lakshmanan, and Wei Lu. 2017. Revenue Maximization in Incentivized Social Advertising. Proc. VLDB Endow. 10, 11 (2017), 1238--1249.
[30]
Çigdem Aslay, Wei Lu, Francesco Bonchi, Amit Goyal, and Laks V. S. Lakshmanan. 2015. Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret. Proc. VLDB Endow. 8, 7 (2015), 822--833.
[31]
Suman Banerjee, Mamata Jenamani, and Dilip Kumar Pratihar. 2020. A survey on influence maximization in a social network. Knowledge and Information Systems 62, 9 (2020), 3417--3455.
[32]
Song Bian, Qintian Guo, Sibo Wang, and Jeffrey Xu Yu. 2020. Efficient algorithms for budgeted influence maximization on massive social networks. Proceedings of the VLDB Endowment 13, 9 (2020), 1498--1510.
[33]
Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In SODA. 946--957.
[34]
Kurt M Bretthauer and Bala Shetty. 2002. The nonlinear knapsack problem--algorithms and applications. European Journal of Operational Research 138, 3 (2002), 459--472.
[35]
Taotao Cai, Jianxin Li, Ajmal S Mian, Timos Sellis, Jeffrey Xu Yu, et al. 2020. Target-aware holistic influence maximization in spatial social networks. TKDE (2020).
[36]
Raul Castro Fernandez. 2022. Protecting Data Markets from Strategic Buyers. In SIGMOD. 1755--1769.
[37]
Lingjiao Chen, Paraschos Koutris, and Arun Kumar. 2019. Towards model-based pricing for machine learning in a data marketplace. In SIGMOD. 1535--1552.
[38]
Wei Chen, Chi Wang, and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In SIGKDD. 1029--1038.
[39]
Wei Chen, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In SIGKDD. 199--208.
[40]
Wei Chen, Yifei Yuan, and Li Zhang. 2010. Scalable influence maximization in social networks under the linear threshold model. In ICDM. 88--97.
[41]
Ying-Ju Chen, Yves Zenou, and Junjie Zhou. 2018. Competitive pricing strategies in social networks. The RAND Journal of Economics 49, 3 (2018), 672--705.
[42]
Suqi Cheng, Huawei Shen, Junming Huang, Wei Chen, and Xueqi Cheng. 2014. IMRank: influence maximization via finding self-consistent ranking. In SIGIR. 475--484.
[43]
Suqi Cheng, Huawei Shen, Junming Huang, Guoqing Zhang, and Xueqi Cheng. 2013. Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In CIKM. 509--518.
[44]
The Koblenz Network Collection. 2017. http://konect.uni-koblenz.de.
[45]
Shaleen Deep and Paraschos Koutris. 2017. QIRANA: A framework for scalable query pricing. In SIGMOD. 699--713.
[46]
Radwa El-Awadi and Mohamed Abu-Rizka. 2015. A framework for negotiating service level agreement of cloud-based services. Procedia Computer Science 65 (2015), 940--949.
[47]
Sainyam Galhotra, Akhil Arora, and Shourya Roy. 2016. Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In SIGMOD. 1077--1088.
[48]
Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters 12, 3 (2001), 211--223.
[49]
Amit Goyal, Wei Lu, and Laks VS Lakshmanan. 2011. Celf: optimizing the greedy algorithm for influence maximization in social networks. In WWW. 47--48.
[50]
Amit Goyal, Wei Lu, and Laks VS Lakshmanan. 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM. 211--220.
[51]
Mark Granovetter. 1978. Threshold models of collective behavior. American journal of sociology 83, 6 (1978), 1420--1443.
[52]
Jianxiong Guo and Weili Wu. 2020. Influence maximization: Seeding based on community structure. TKDD 14, 6 (2020), 1--22.
[53]
Kai Han, Benwei Wu, Jing Tang, Shuang Cui, Cigdem Aslay, and Laks VS Lakshmanan. 2021. Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. In SIGMOD. 671--684.
[54]
Shuo Han, Fuzhen Zhuang, Qing He, and Zhongzhi Shi. 2014. Balanced seed selection for budgeted influence maximization in social networks. In PAKDD. 65--77.
[55]
Keke Huang, Jing Tang, Xiaokui Xiao, Aixin Sun, and Andrew Lim. 2020. Efficient approximation algorithms for adaptive target profit maximization. In ICDE. 649--660.
[56]
Shixun Huang, Zhifeng Bao, J Shane Culpepper, and Bang Zhang. 2019. Finding temporal influential users over evolving social networks. In 2019 IEEE 35th international conference on data engineering (ICDE). IEEE, 398--409.
[57]
Shixun Huang, Wenqing Lin, Zhifeng Bao, and Jiachen Sun. 2022. Influence maximization in real-world closed social networks. PVLDB 16, 2 (2022), 180--192.
[58]
Kyomin Jung, Wooram Heo, and Wei Chen. 2012. Irie: Scalable and robust influence maximization in social networks. In ICDM. 918--923.
[59]
Mohammad Mehdi Keikha, Maseud Rahgozar, Masoud Asadpour, and Mohammad Faghih Abdollahi. 2020. Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Systems with Applications 140 (2020), 112905.
[60]
David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In SIGKDD. 137--146.
[61]
Anton J Kleywegt and Jason D Papastavrou. 1998. The dynamic and stochastic knapsack problem. Operations research 46, 1 (1998), 17--35.
[62]
Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, and Dan Suciu. 2013. Toward practical query pricing with querymarket. In SIGMOD. 613--624.
[63]
Siyu Lei, Silviu Maniu, Luyi Mo, Reynold Cheng, and Pierre Senellart. 2015. Online influence maximization. In SIGKDD. 645--654.
[64]
Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In SIGKDD. 420--429.
[65]
Jianxin Li, Taotao Cai, Ke Deng, Xinjue Wang, Timos Sellis, and Feng Xia. 2020. Community-diversified influence maximization in social networks. Information Systems 92 (2020), 101522.
[66]
Lingfei Li, Yezheng Liu, Qing Zhou, Wei Yang, and Jiahang Yuan. 2020. Targeted influence maximization under a multifactor-based information propagation model. Information Sciences 519 (2020), 124--140.
[67]
Ping Liu, Meng Wang, Jiangtao Cui, and Hui Li. 2021. Top-k competitive location selection over moving objects. Data Science and Engineering 6, 4 (2021), 392--401.
[68]
Ziyang Liu and Hakan Hacigümüs. 2014. Online optimization and fair costing for dynamic data sharing in a cloud data market. In SIGMOD. 1359--1370.
[69]
George B Mathews. 1896. On the partition of numbers. Proceedings of the London Mathematical Society 1, 1 (1896), 486--490.
[70]
Shubhadip Mitra, Priya Saraf, Richa Sharma, Arnab Bhattacharya, and Sayan Ranu. 2019. Netclus: A scalable framework to mine top-k locations for placement of trajectory-aware services. In Proceedings of the ACM India Joint International Conference on Data Science and Management of Data. 27--35.
[71]
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions. Mathematical programming 14, 1 (1978), 265--294.
[72]
Huy Nguyen and Rong Zheng. 2013. On budgeted influence maximization in social networks. IEEE J-SAC 31, 6 (2013), 1084--1094.
[73]
Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, and Ken-ichi Kawarabayashi. 2014. Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. In AAAI. 138--144.
[74]
George Panagopoulos, Fragkiskos D Malliaros, and Michalis Vazirgianis. 2020. Influence maximization using influence and susceptibility embeddings. In AAAI, Vol. 14. 511--521.
[75]
Pierre Perrault, Jennifer Healey, Zheng Wen, and Michal Valko. 2020. Budgeted online influence maximization. In ICML. 7620--7631.
[76]
Ulrich Pferschy and Joachim Schauer. 2009. The Knapsack Problem with Conflict Graphs. J. Graph Algorithms Appl. 13, 2 (2009), 233--249.
[77]
David Pisinger. 1995. A minimal algorithm for the multiple-choice knapsack problem. European Journal of Operational Research 83, 2 (1995), 394--410.
[78]
Sijie Ruan, Jie Bao, Yuxuan Liang, Ruiyuan Li, Tianfu He, Chuishi Meng, Yanhua Li, Yingcai Wu, and Yu Zheng. 2020. Dynamic public resource allocation based on human mobility prediction. Proceedings of the ACM on interactive, mobile, wearable and ubiquitous technologies 4, 1 (2020), 1--22.
[79]
Xiaobin Rui, Xiaodong Yang, Jianping Fan, and Zhixiao Wang. 2020. A neighbour scale fixed approach for influence maximization in social networks. Computing 102, 2 (2020), 427--449.
[80]
Grant Schoenebeck and Biaoshuai Tao. 2020. Influence Maximization on Undirected Graphs: Toward Closing the (1--1/e) Gap. ACM Transactions on Economics and Computation (TEAC) 8, 4 (2020), 1--36.
[81]
Prabhakant Sinha and Andris A Zoltners. 1979. The multiple-choice knapsack problem. Operations Research 27, 3 (1979), 503--515.
[82]
Haiqi Sun, Reynold Cheng, Xiaokui Xiao, Jing Yan, Yudian Zheng, and Yuqiu Qian. 2018. Maximizing social influence for the awareness threshold model. In DASFAA. 491--510.
[83]
Jing Tang, Xueyan Tang, and Junsong Yuan. 2016. Profit maximization for viral marketing in online social networks. In ICNP. 1--10.
[84]
Shaojie Tang and Jing Yuan. 2020. Influence maximization with partial feedback. Operations Research Letters 48, 1 (2020), 24--28.
[85]
Youze Tang, Yanchen Shi, and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In SIGMOD. 1539--1554.
[86]
Youze Tang, Xiaokui Xiao, and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD. 75--86.
[87]
Yongxin Tong, Libin Wang, Zimu Zhou, Lei Chen, Bowen Du, and Jieping Ye. 2018. Dynamic pricing in spatial crowdsourcing: A matching-based approach. In SIGMOD. 773--788.
[88]
FATMANUR AKDOGAN UZUN, DOGAN ALTAN, Ercan Peker, MAHMUT ALTUG ÜSTÜN, and Sanem Sariel. 2020. Optimization of real-world outdoor campaign allocations. Turkish Journal of Electrical Engineering and Computer Sciences 28, 3 (2020), 1276--1292.
[89]
Qian Wang, Rajan Batta, Joyendu Bhadury, and Christopher M Rump. 2003. Budget constrained location problem with opening and closing of facilities. Computers & Operations Research 30, 13 (2003), 2047--2069.
[90]
Linlin Wu, Saurabh Kumar Garg, Rajkumar Buyya, Chao Chen, and Steve Versteeg. 2013. Automated SLA negotiation framework for cloud computing. In International Symposium on Cluster, Cloud, and Grid Computing. 235--244.
[91]
Xiaomin Xi, Ramteen Sioshansi, and Vincenzo Marano. 2013. Simulation--optimization model for location of a public electric vehicle charging infrastructure. Transportation Research Part D: Transport and Environment 22 (2013), 60--69.
[92]
Yipeng Zhang, Yuchen Li, Zhifeng Bao, Songsong Mo, and Ping Zhang. 2019. Optimizing Impression Counts for Outdoor Advertising. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, Anchorage, AK, USA, August 4--8, 2019, Ankur Teredesai, Vipin Kumar, Ying Li, Rómer Rosales, Evimaria Terzi, and George Karypis (Eds.). ACM, 1205--1215.
[93]
Yipeng Zhang, Yuchen Li, Zhifeng Bao, Baihua Zheng, and HV Jagadish. 2021. Minimizing the Regret of an Influence Provider. In SIGMOD. 2115--2127.
[94]
Yuqing Zhu, Jing Tang, and Xueyan Tang. 2020. Pricing influential nodes in online social networks. Proceedings of the VLDB Endowment 13, 10 (2020), 1614--1627.

Cited By

View all
  • (2024)Window Function Expression: Let the Self-Join EnterProceedings of the VLDB Endowment10.14778/3665844.366584817:9(2162-2174)Online publication date: 6-Aug-2024
  • (2024)Proximity Queries on Point Clouds using Rapid Construction Path OracleProceedings of the ACM on Management of Data10.1145/36392612:1(1-26)Online publication date: 26-Mar-2024

Index Terms

  1. Managing Conflicting Interests of Stakeholders in Influencer Marketing

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Proceedings of the ACM on Management of Data
      Proceedings of the ACM on Management of Data  Volume 1, Issue 1
      PACMMOD
      May 2023
      2807 pages
      EISSN:2836-6573
      DOI:10.1145/3603164
      Issue’s Table of Contents
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 30 May 2023
      Published in PACMMOD Volume 1, Issue 1

      Permissions

      Request permissions for this article.

      Author Tags

      1. influencers
      2. pricing
      3. profit divergence
      4. social networks

      Qualifiers

      • Research-article

      Funding Sources

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)95
      • Downloads (Last 6 weeks)3
      Reflects downloads up to 25 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Window Function Expression: Let the Self-Join EnterProceedings of the VLDB Endowment10.14778/3665844.366584817:9(2162-2174)Online publication date: 6-Aug-2024
      • (2024)Proximity Queries on Point Clouds using Rapid Construction Path OracleProceedings of the ACM on Management of Data10.1145/36392612:1(1-26)Online publication date: 26-Mar-2024

      View Options

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media