Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On the submodularity of influence in social networks
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The role of compatibility in the diffusion of technologies through social networks
Proceedings of the 8th ACM conference on Electronic commerce
Maximizing influence in a competitive social network: a follower's perspective
Proceedings of the ninth international conference on Electronic commerce
Word of Mouth: Rumor Dissemination in Social Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Social and Economic Networks
A note on competitive diffusion through social networks
Information Processing Letters
On the Approximability of Influence in Social Networks
SIAM Journal on Discrete Mathematics
Competitive influence maximization in social networks
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Threshold models for competitive influence in social networks
WINE'10 Proceedings of the 6th international conference on Internet and network economics
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
Strategyproof mechanisms for competitive influence in networks
Proceedings of the 22nd international conference on World Wide Web
| Hi-index | 0.00 |
We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible (respectively necessary) and the ones for which a unique outcome is guaranteed. These characterizations directly yield polynomial time algorithms that allow us to determine whether a given social network satisfies one of the above properties. We also study algorithmic questions for networkswithout unique outcomes.We show that the problem of computing the minimum possible spread of a product is NP-hard to approximate with an approximation ratio better than Ω(n), in contrast to the maximum spread, which is efficiently computable. We then move on to questions regarding the behavior of a node with respect to adopting some (resp. a given) product. We show that the problem of determining whether a given node has to adopt some (resp. a given) product in all final networks is co-NP-complete.