Mechanisms for multi-level marketing
Proceedings of the 12th ACM conference on Electronic commerce
Diffusion in social networks with competing products
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?
Proceedings of the 23rd ACM conference on Hypertext and social media
Containment of misinformation spread in online social networks
Proceedings of the 3rd Annual ACM Web Science Conference
Reversible iterative graph processes
Theoretical Computer Science
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
Minimum weight dynamo and fast opinion spreading
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
A game-theoretic analysis of a competitive diffusion process over social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Choosing products in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
What i tell you three times is true: bootstrap percolation in small worlds
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Constant thresholds can make target set selection tractable
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Large Social Networks Can Be Targeted for Viral Marketing with Small Seed Sets
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
ACM Transactions on Computational Logic (TOCL)
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Discrete Applied Mathematics
A cutting-plane algorithm for solving a weighted influence interdiction problem
Computational Optimization and Applications
| Hi-index | 0.00 |
In this paper, we study the spread of influence through a social network in a model initiated by Kempe, Kleinberg, and Tardos [Maximizing the spread of influence through a social network, in Proceedings of the 9th ACM SIGKIDD International Conference, Washington, D.C., 2003, pp. 137-146], [Influential nodes in a diffusion model for social networks, in Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP), Lisbon, Portugal, CITI, 2005, pp. 1127-1138]: Given a graph modeling a social network, where each node $v$ has a (fixed) threshold $t_v$, the node will adopt a new product if $t_v$ of its neighbors adopt it. Our goal is to find a small set $S$ of nodes such that targeting the product to $S$ would lead to adoption of the product by a large number of nodes in the graph. We show strong inapproximability results for several variants of this problem. Our main result says that the problem of minimizing the size of $S$, while ensuring that targeting $S$ would influence the whole network into adopting the product, is hard to approximate within a polylogarithmic factor. This implies a similar result if only a fixed fraction of the network is ensured to adopt the product. Further, the hardness of approximation result continues to hold when all nodes have majority thresholds or have constant degrees and thresholds two. The latter answers a complexity question proposed in [P. A. Dreyer, Applications and Variations of Domination in Graphs, Ph.D. thesis, Rutgers University, Piscataway, NJ, 2000], [F. S. Roberts, Graph-theoretical problems arising from defending against bioterrorism and controlling the spread of fires, in Proceedings of DIMACS/DIMATIA/Renyi Combinatorial Challenges Conference, Piscataway, NJ, 2006]. When the underlying graph is a tree, we give a polynomial-time algorithm to find an optimal solution.