The Competitive Diffusion Game in Classes of Graphs
We study a game based on a model for the spread of influence through social networks. In game theory, a Nash-equilibrium is a strategy profile in which each player’s strategy is optimized with respect to her opponents’ strategies. Here we focus on a specific two player case of the game. We show that there always exists a Nash-equilibrium for paths, cycles, trees, and Cartesian grids. We use the centroid of trees to find a Nash-equilibrium for a tree with a novel approach, which is simpler compared to previous works. We also explore the existence of Nash-equilibriums for uni-cyclic graphs, and offer some open problems.
KeywordsCompetitive information diffusion Nash-equilibriums Network game theory Social networks
Unable to display preview. Download preview PDF.
- 3.Bhagat, S., Goyal, A., Lakshmanan, L.V.S.: Maximizing Product Adoption in Social Networks. In: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, pp. 603–612 (2012)Google Scholar
- 5.Immorlica, N., Kleinberg, J.M., Mahdian, M., Wexler, T.: The role of compatibility in the diffusion of technologies through social networks. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 75–83 (2007)Google Scholar
- 6.Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining (KDD), pp. 137–146 (2003)Google Scholar
- 11.West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall Inc., Upper Saddle River (2001)Google Scholar