Budgeted Influence Maximization for Multiple Products

12/08/2013
by   Nan Du, et al.
0

The typical algorithmic problem in viral marketing aims to identify a set of influential users in a social network, who, when convinced to adopt a product, shall influence other users in the network and trigger a large cascade of adoptions. However, the host (the owner of an online social platform) often faces more constraints than a single product, endless user attentions, unlimited budget and unbounded time; in reality, multiple products need to be advertised, each user can tolerate only a small number of recommendations, influencing user has a cost and advertisers have only limited budgets, and the adoptions need to be maximized within a short time window. Given theses myriads of user, monetary, and timing constraints, it is extremely challenging for the host to design principled and efficient viral market algorithms with provable guarantees. In this paper, we provide a novel solution by formulating the problem as a submodular maximization in a continuous-time diffusion model under an intersection of a matroid and multiple knapsack constraints. We also propose an adaptive threshold greedy algorithm which can be faster than the traditional greedy algorithm with lazy evaluation, and scalable to networks with million of nodes. Furthermore, our mathematical formulation allows us to prove that the algorithm can achieve an approximation factor of k_a/(2+2 k) when k_a out of the k knapsack constraints are active, which also improves over previous guarantees from combinatorial optimization literature. In the case when influencing each user has uniform cost, the approximation becomes even better to a factor of 1/3. Extensive synthetic and real world experiments demonstrate that our budgeted influence maximization algorithm achieves the-state-of-the-art in terms of both effectiveness and scalability, often beating the next best by significant margins.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2020

Earned Benefit Maximization in Social Networks Under Budget Constraint

Given a social network with nonuniform selection cost of the users, the ...
research
12/24/2017

Towards Profit Maximization for Online Social Network Providers

Online Social Networks (OSNs) attract billions of users to share informa...
research
08/24/2019

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks

We study a natural model of coordinated social ad campaigns over a socia...
research
07/16/2020

Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies

In the adaptive influence maximization problem, we are given a social ne...
research
09/14/2022

Voting-based Opinion Maximization

We investigate the novel problem of voting-based opinion maximization in...
research
11/19/2018

On the Network Visibility Problem

Social media is an attention economy where users are constantly competin...
research
10/09/2019

A k-hop Collaborate Game Model: Adaptive Strategy to Maximize Total Revenue

In Online Social Networks (OSNs), interpersonal communication and inform...

Please sign up or login with your details

Forgot password? Click here to reset