Profit Maximization in Closed Social Networks
Poonam Sharma, Suman Banerjee

TL;DR
This paper addresses profit maximization in closed social networks for viral marketing, proposing new algorithms that outperform baselines in real-world datasets by considering limited diffusion links and seed selection within a budget.
Contribution
It introduces the PMCSN problem, generalizes influence maximization, and proposes sampling-based and heuristic solutions with analysis and experimental validation.
Findings
Proposed algorithms achieve higher profit than baseline methods.
Analysis of sample complexity, runtime, and space requirements.
Experimental results on real-world datasets validate effectiveness.
Abstract
Diffusion of information, innovation, and ideas is an important phenomenon in social networks. Information propagates through the network and reaches from one person to the next. In many settings, it is meaningful to restrict diffusion so that each node can spread information to only a limited number of its neighbors rather than to all of them. Such social networks are called closed social networks. In recent years, social media platforms have emerged as an effective medium for commercial entities, where the objective is to maximize profit. In this paper, we study the Profit Maximization in Closed Social Networks (PMCSN) problem in the context of viral marketing. The input to the problem is a closed social network and two positive integers and . The problem asks to select seed nodes within a given budget ; during the diffusion process, each node is restricted to choose at…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Mobile Crowdsensing and Crowdsourcing · Advanced Graph Neural Networks
