Abstract : Influencer marketing has become in the recent years a thriving industry that includes more than 1120 agencies worldwide and with a global market value expected to reach 15 billion dollars by 2022. The advertising problem that such agencies face is the following: given a monetary budget find a set of appropriate influencers on a social platform and recruit them to create a number of posts for the promotion of a certain product. The objective of the campaign is to maximize some impact metric, e.g. the number of impressions, the sales, or the audience reach. In this work, we present an original formulation of the budgeted campaign orchestration problem as a convex program, and further derive a near-optimal algorithm to solve it efficiently. The proposed algorithm has low computational complexity and can scale well for problems with large numbers (millions) of social users, encountered in real-world platforms. We apply our algorithm to a Twitter data set and illustrate the optimal campaign performance for various metrics of interest.
https://hal.archives-ouvertes.fr/hal-03247164 Contributor : Anastasios GiovanidisConnect in order to contact the contributor Submitted on : Wednesday, June 2, 2021 - 8:10:27 PM Last modification on : Wednesday, March 16, 2022 - 3:51:00 AM Long-term archiving on: : Friday, September 3, 2021 - 8:05:51 PM
Ricardo José López-Dawn, Anastasios Giovanidis. Social Influencer Selection by Budgeted Portfolio Optimization. 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt) 2021, IFIP, Oct 2021, Philadelphia, United States. pp.1-8, ⟨10.23919/WiOpt52861.2021.9589109⟩. ⟨hal-03247164⟩