Complexity of equilibrium in competitive diffusion games on social networks

Automatica

Volumn 68, Issue , 2016, Pages 100-110

  Etesami, Seyed Rasoul ^a   Başar, Tamer ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Competitive diffusion game; Erdos Renyi graphs; NP hardness; Pure strategy Nash equilibrium; Social welfare; Sub modular function

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DIFFUSION; GAME THEORY; TELECOMMUNICATION NETWORKS;

COMPETITIVE DIFFUSION GAME; ERDOS-RENYI GRAPHS; MODULAR FUNCTIONS; NP-HARDNESS; PURE STRATEGY NASH EQUILIBRIUMS; SOCIAL WELFARE;

COMPLEX NETWORKS;

EID: 84958824487     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2016.01.063     Document Type: Article

References (36)

1. Daron Acemoglu, Giacomo Como, Fabio Fagnani, and Asuman Ozdaglar Opinion fluctuations and disagreement in social networks Mathematics of Operations Research 38 1 2013 1 27
2. Daron Acemoglu, Giacomo Como, Fabio Fagnani, and Asuman Ozdaglar Message passing optimization of harmonic influence centrality ACM SIGMETRICS Performance Evaluation Review 42 3 2014
3. Daron Acemoglu, Asuman Ozdaglar, and Ercan Yildiz Diffusion of innovations in social networks 2011 50th IEEE conference on decision and control and European control conference (CDC-ECC) 2011 IEEE 2329 2334
4. Eyal Ackerman, Oren Ben-Zwi, and Guy Wolfovitz Combinatorial model and bounds for target set selection Theoretical Computer Science 411 44 2010 4017 4022
5. Noga Alon, Michal Feldman, Ariel D. Procaccia, and Moshe Tennenholtz A note on competitive diffusion through social networks Information Processing Letters 110 6 2010 221 225
6. Noga Alon, and Joel H. Spencer The probabilistic method 2004 John Wiley & Sons
7. Tamer Başar, and Geert Jan Olsder Dynamic noncooperative game theory. Vol. 23 1999 SIAM
8. Shishir Bharathi, David Kempe, and Mahyar Salek Competitive influence maximization in social networks Internet and network economics 2007 Springer 306 311
9. Béla Bollobás Random graphs 1998 Springer
10. Simina Brânzei, and Kate Larson Social distance games Proceedings of the twenty-second international joint conference on artificial intelligence-volume One 2011 AAAI Press 91 96
11. Christoph Dürr, and Nguyen Kim Thang Nash equilibria in voronoi games on graphs Algorithms-ESA 2007 2007 Springer 17 28
12. Erdos, P., & Renyi, A. (1959). On random graphs I. In Publ. math. debrecen. Vol. 6 (pp. 290-297).
13. Seyed Rasoul Etesami, and Tamer Başar Complexity of equilibrium in diffusion games on social networks Proc. American control conference, ACC 2014 2014 IEEE Portland, OR 2077 2082
14. MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab Mirrokni, and Sina Sadeghian Sadeghabad On the non-progressive spread of influence through social networks LATIN 2012: theoretical informatics 2012 Springer 315 326
15. Michael R. Garey, and David S. Johnson Complexity results for multiprocessor scheduling under resource constraints SIAM Journal on Computing 4 4 1975 397 411
16. Javad Ghaderi, and R. Srikant Opinion dynamics in social networks: A local interaction game with stubborn agents American control conference, ACC, 2013 2013 IEEE 1982 1987
17. Gionis, Aristides, Terzi, Evimaria, & Tsaparas, Panayiotis (2013). Opinion maximization in social networks. ArXiv Preprint: arXiv:1301.7455.
18. Sanjeev Goyal, and Michael Kearns Competitive contagion in networks Proceedings of the 44th symposium on theory of computing 2012 ACM 759 774
19. Hajek, Bruce, Wu, Yihong, & Xu, Jiaming (2014). Computational lower bounds for community detection on random graphs. ArXiv preprint: arXiv:1406.6625.
20. Ali Jadbabaie, Jie Lin, and A. Stephen Morse Coordination of groups of mobile autonomous agents using nearest neighbor rules IEEE Transactions on Automatic Control 48 6 2003 988 1001
21. David Kempe, Jon Kleinberg, and Éva Tardos Maximizing the spread of influence through a social network Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining 2003 ACM 137 146
22. Khanafer, Ali, & Başar, Tamer (2014). Information spread in networks: control, games, and equilibria. In Proc. information theory and applications workshop, ITA'14, San Diego, California.
23. Ali Khanafer, Tamer Başar, and Bahman Gharesifard Stability properties of infected networks with low curing rates Proc. 2014 American control conference (ACC 2014) 2014 IEEE Portland, OR 3591 3596
24. Elchanan Mossel, and Sebastien Roch Submodularity of influence in social networks: From local to global SIAM Journal on Computing 39 6 2010 2176 2188
25. M.E.J. Newman Detecting community structure in networks The European Physical Journal B 38 2004 321 330
26. Keith Paton An algorithm for the blocks and cutnodes of a graph Communications of the ACM 14 7 1971 468 475
27. Matthew Richardson, and Pedro Domingos Mining knowledge-sharing sites for viral marketing Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining 2002 ACM 61 70
28. Yaron Singer How to win friends and influence people, truthfully: influence maximization mechanisms for social networks Proceedings of the fifth ACM international conference on web search and data mining 2012 ACM 733 742
29. Lucy Small, and Oliver Mason Information diffusion on the iterated local transitivity model of online social networks Discrete Applied Mathematics 2012
30. Lucy Small, and Oliver Mason Nash equilibria for competitive information diffusion on trees Information Processing Letters 113 7 2013 217 219
31. Reiko Takehara, Masahiro Hachimori, and Maiko Shigeno A comment on pure-strategy Nash equilibria in competitive diffusion games Information Processing Letters 112 3 2012 59 60
32. Vasileios Tzoumas, Christos Amanatidis, and Evangelos Markakis A game-theoretic analysis of a competitive diffusion process over social networks Internet and network economics 2012 Springer 1 14
33. Luca Vassio, Fabio Fagnani, Paolo Frasca, and Asuman Ozdaglar Harmonic influence in large-scale networks IEEE Transactions on Control of Network Systems 1 1 2014
34. Wu, Fang, & Huberman, Bernardo A. (2003). Finding communities in linear time: A physics approach. In http://arxiv.org/abs/cond-mat/0310600.
35. Yildiz, Ercan, Acemoglu, Daron, Ozdaglar, Asuman, Saberi, Amin, & Scaglione, Anna (2011). Discrete opinion dynamics with stubborn agents. Available at: SSRN 1744113.
36. Young, H. Peyton (2002). The diffusion of innovations in social networks. In Economy as an evolving complex system. proceedings volume. In Santa Fe Institute studies in the sciences of complexity. Vol. 3 (pp. 267-282).