Diffusion in Social Networks with Competing Products

  title={Diffusion in Social Networks with Competing Products},
  author={Krzysztof R. Apt and Evangelos K. Markakis},
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… 
Social Networks with Competing Products
A new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives, is introduced, and it is shown that the problem of determining whether a final network exists in which all nodes adopted some product is NP-complete.
Choosing Products in Social Networks
It is shown that such games may have no Nash equilibrium and that determining the existence of a Nash equilibrium, also of a special type, is NP-complete and that the status and the complexity of the finite improvement property (FIP) are clarified.
Social Network Games with Obligatory Product Selection
It is shown that social networks exist with the property that by adding an additional product to a specific node, the choices of the nodes will unavoidably evolve in such a way that everybody is strictly worse off.
Paradoxes in social networks with multiple products
It is shown that various paradoxes can arise in a natural class of social networks and these paradoxes shed light on possible inefficiencies arising when one modifies the sets of products available to the agents forming a social network or the network structure.
Social network games
It is shown that polymatrix games may have no Nash equilibrium and that determining an existence of a Nash equilibrium, also of a special type, is NP-complete, and that this implies the same result for a more general class of games, namely poly matrix games.
Optimizing the choice of influential nodes for diffusion on a social network
A bi‐objective probabilistic integer programming model is developed that assumes that actors are heterogeneous in the probability that they will pass messages along their ego networks.
Balancing spreads of influence in a social network
This paper investigates a natural generalization of this optimization problem in which μ different campaigns propagate in the network and aims to maximize the expected number of nodes that are reached by at least ν or none of the campaigns, where μ ≥ ν ≥ 2.
Competitiveness Maximization on Complex Networks
A model of competition on complex networks, in which two competitors are fixed to opposite states while other agents, called normal agents, adjust their states according to a distributed consensus protocol, is considered, which proves that Problem 1 is NP-hard and that GA always provides the best approximate solution to Problem 2.
Strategyproof Mechanisms for Competitive Influence in Networks
A game-theoretic scenario in which competing advertisers want to target initial adopters in a social network is considered, motivated by applications to word-of-mouth advertising, and it is demonstrated that under an additional assumption there exists a simpler strategyproof mechanism when there are only two players.
Power indices of influence games and new centrality measures for social networks
Two of the most classical power indices, i.e., Banzhaf and Shapley-Shubik indices, are considered as centrality measures for social networks in influence games to analyze the relevance of the actors in process related to spread of influence.


Threshold Models for Competitive Influence in Social Networks
It is shown that for a broad family of competitive influence models, it is NP-hard to achieve an approximation that is better than a square root of the optimal solution.
On the approximability of influence in social networks
  • Ning Chen
  • Computer Science, Mathematics
    SODA '08
  • 2008
The 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.
Competitive Influence Maximization in Social Networks
A natural and mathematically tractable model for the diffusion of multiple innovations in a network, and a (1-1/e) approximation algorithm for computing the best response to an opponent's strategy are given.
Maximizing influence in a competitive social network: a follower's perspective
This work considers the problem faced by a company that wants to use viral marketing to introduce a new product into a market where a competing product is already being introduced and proposes two models for the spread of influence of competing technologies through a social network.
A note on competitive diffusion through social networks
Word of Mouth: Rumor Dissemination in Social Networks
This paper uses concepts of game theory and location theory and model the selection of starting nodes for the rumors as a strategic game and proves that computing the optimal strategy for both the first and the second player is NP-complete, even in a most restricted model.
Mining the network value of customers
It is proposed to model also the customer's network value: the expected profit from sales to other customers she may influence to buy, the customers those may influence, and so on recursively, taking advantage of the availability of large relevant databases.
The role of compatibility in the diffusion of technologies through social networks
This work describes how a new technology A might spread through a social network of individuals who are currently users of technology B depends on both its quality relative to B, and also this additional cost of adopting both, and finds some surprising non-monotonicity properties in the dependence on these parameters.
Introduction to Connections: An Introduction to the Economics of Networks
Networks pervade social and economic life, and they play a prominent role in explaining a huge variety of social and economic phenomena. Standard economic theory did not give much credit to the role
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
The results clearly indicate that information dissemination is dominated by both weak and strong w-o-m, rather than by advertising, which means that strong and weak ties become the main forces propelling growth.