Host Profit Maximization: Leveraging Performance Incentives and User Flexibility
Xueqin Chang, Xiangyu Ke, Lu Chen, Congcong Ge, Ziheng Wei, Yunjun Gao
Abstract
The social network host has knowledge of the network structure and user characteristics and can earn a profit by providing merchants with viral marketing campaigns. We investigate the problem of host profit maximization by leveraging performance incentives and user flexibility. To incentivize the host's performance, we propose setting a desired influence threshold that would allow the host to receive full payment, with the possibility of a small bonus for exceeding the threshold. Unlike existing works that assume a user's choice is frozen once they are activated, we introduce the Dynamic State Switching model to capture "comparative shopping" behavior from an economic perspective, in which users have the flexibilities to change their minds about which product to adopt based on the accumulated influence and propaganda strength of each product. In addition, the incentivized cost of a user serving as an influence source is treated as a negative part of the host's profit.
The host profit maximization problem is NP-hard, submodular, and non-monotone. To address this challenge, we propose an efficient greedy algorithm and devise a scalable version with an approximation guarantee to select the seed sets. As a side contribution, we develop two seed allocation algorithms to balance the distribution of adoptions among merchants with small profit sacrifice. Through extensive experiments on four real-world social networks, we demonstrate that our methods are effective and scalable.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 39430c7b-e8e6-4af1-b58c-6fe7c8b067bdCited by top-tier papers1
Ask how each one uses itBuilds on8
- Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound TightenedQintian Guo, Sibo Wang, Zhewei Wei, Ming ChenSIGMOD 2020 · 80 citations
- Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit MaximizationTianyuan Jin, Yu Yang, Renchi Yang, Jieming Shi et al.VLDB 2021 · 31 citations
- Maximizing Fair Content Spread via Edge Suggestion in Social NetworksIan P. Swift, Sana Ebrahimi, Azade Nova, Abolfazl AsudehVLDB 2022 · 19 citations
- Collective Influence Maximization for Multiple Competing Products with an Awareness-to-Influence ModelDimitris Tsaras, George Trimponias, Lefteris Ntaflos, Dimitris PapadiasVLDB 2021 · 19 citations
- Minimizing the Regret of an Influence ProviderYipeng Zhang, Yuchen Li, Zhifeng Bao, Baihua Zheng et al.SIGMOD 2021 · 18 citations
Related papers
- Motif-oriented influence maximization for viral marketing in large-scale social networksMingyang Zhou, Weiji Cao, Hao Liao, Rui MaoNeurIPS 2024 · 1 citation
- Maximizing Social Welfare in a Competitive Diffusion ModelPrithu Banerjee, Laks V. S. Lakshmanan, Wei ChenVLDB 2021 · 9 citations
- Efficient and Effective Algorithms for Revenue Maximization in Social AdvertisingKai Han, Benwei Wu, Jing Tang, Shuang Cui et al.SIGMOD 2021 · 13 citations
- Dynamic Gradient Influencing for Viral Marketing Using Graph Neural NetworksSaurabh Sharma, Ambuj K. SinghWWW 2025
- Influence Maximization Based on Dynamic Personal Perception in Knowledge GraphYa-Wen Teng, Yishuo Shi, Chih-Hua Tai, De-Nian Yang et al.ICDE 2021 · 11 citations
