Diversified-profit maximization in competitive social advertising

Liman Du (), Suixiang Gao () and Wenguo Yang ()
Additional contact information
Liman Du: University of Chinese Academy of Sciences
Suixiang Gao: University of Chinese Academy of Sciences
Wenguo Yang: University of Chinese Academy of Sciences

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 40, 19 pages

Abstract: Abstract Due to the important role that social networks play in advertisements and propaganda, influence maximization (IM) problem which aims at finding some influential users as seeds to trigger large online cascading influence spread has been a hot research topic in the past two decades. As an extension of classical IM problem, profit maximization (PM) problem is inspired by product promotion and focuses on the profit generated by consumer. Given that competitive social advertising is more common in real-world, a series of studies propose some versions of PM problem. However, the competition happening in the information dissemination of imperfect substitutes and the influence of potential consumers’ preference have been mostly ignored. Besides, to the best of our knowledge, no research pays attention on the fact that some companies may snatch seeds to limit the profits of their opponents. Therefore, we propose a novel competition-based diversified-profit maximization (CDM) problem and its adaptive version, i.e., adaptive competition-based diversified-profit maximization (ACDM) problem. Different from prior works, these problems take seed’s preference into consideration and use social welfare to reflect it. These two problems aim at selecting seeds and allocating them to marketers such that the sum of profit generated by consumers for a special entity after information dissemination and social welfare with respect to seed allocation reaches maximum. To address these two problems, we design an algorithm which combines the method of online allocation and the concept of Shapley value. Experimental results on three real-world data sets demonstrate the effectiveness of our proposed algorithm.

Keywords: Profit maximization; Online seed allocation; Nonsubmodularity; Competitive social advertising (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00967-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00967-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00967-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().