Complexity of equilibrium in diffusion games on social networks

Proceedings of the American Control Conference

Volumn , Issue , 2014, Pages 2065-2070

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

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

Author keywords

Competitive diffusion game; greedy algorithm; NP hardness; pure Nash equilibrium; social welfare; sub modular function

Indexed keywords

COMPLEX NETWORKS; GAME THEORY;

COMPETITIVE DIFFUSION GAME; GREEDY ALGORITHMS; NP-HARDNESS; PURE NASH EQUILIBRIUM; SOCIAL WELFARE;

DIFFUSION;

EID: 84905715401     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2014.6859194     Document Type: Conference Paper

References (21)

1. S. R. Etesami, T. Başar, A. Nedic, and B. Touri, "Termination time of multidimensional Hegselmann-Krause opinion dynamics", in American Control Conference (ACC), 2013. IEEE, 2013, pp. 1255-1260.
2. S. Goyal and M. Kearns, "Competitive contagion in networks", in Proceedings of the 44th Symposium on Theory of Computing. ACM, 2012, pp. 759-774.
3. H. P. Young, "The diffusion of innovations in social networks", Economy as an Evolving Complex System. Proceedings Volume in the Santa Fe Institute Studies in the Sciences of Complexity, vol. 3, pp. 267-282, 2002.
4. D. Acemoglu, A. Ozdaglar, and E. Yildiz, "Diffusion of innovations in social networks", in Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on. IEEE, 2011, pp. 2329-2334.
5. D. Kempe, J. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network", in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2003, pp. 137-146.
6. M. Richardson and P. Domingos, "Mining knowledge-sharing sites for viral marketing", in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2002, pp. 61-70.
7. S. Bharathi, D. Kempe, and M. Salek, "Competitive influence maximization in social networks", in Internet and Network Economics. Springer, 2007, pp. 306-311.
8. S. Brânzei and K. Larson, "Social distance games", in Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence-Volume One. AAAI Press, 2011, pp. 91-96.
9. Y. Singer, "How to win friends and influence people, truthfully: influence maximization mechanisms for social networks", in Proceedings of the Fifth ACM International Conference on Web Search and Data Mining. ACM, 2012, pp. 733-742.
10. N. Alon, M. Feldman, A. D. Procaccia, and M. Tennenholtz, "A note on competitive diffusion through social networks", Information Processing Letters, vol. 110, no. 6, pp. 221-225, 2010.
11. R. Takehara, M. Hachimori, and M. Shigeno, "A comment on purestrategy Nash equilibria in competitive diffusion games", Information Processing Letters, vol. 112, no. 3, pp. 59-60, 2012.
12. E. Yildiz, D. Acemoglu, A. Ozdaglar, A. Saberi, and A. Scaglione, "Discrete opinion dynamics with stubborn agents", Available at SSRN 1744113, 2011.
13. M. Fazli, M. Ghodsi, J. Habibi, P. J. Khalilabadi, V. Mirrokni, and S. S. Sadeghabad, "On the non-progressive spread of influence through social networks", in LATIN 2012: Theoretical Informatics. Springer, 2012, pp. 315-326.
14. E. Ackerman, O. Ben-Zwi, and G. Wolfovitz, "Combinatorial model and bounds for target set selection", Theoretical Computer Science, vol. 411, no. 44, pp. 4017-4022, 2010.
15. A. Gionis, E. Terzi, and P. Tsaparas, "Opinion maximization in social networks", arXiv preprint arXiv:1301.7455, 2013.
16. L. Small and O. Mason, "Information diffusion on the iterated local transitivity model of online social networks", Discrete Applied Mathematics, 2012.
17. -, "Nash equilibria for competitive information diffusion on trees", Information Processing Letters, vol. 113, no. 7, pp. 217-219, 2013.
18. S. R. Etesami and T. Başar, "Complexity of equilibrium in diffusion games on social networks", arXiv:1403.3881v1, 2014.
19. E. Mossel and S. Roch, "Submodularity of influence in social networks: From local to global", SIAM Journal on Computing, vol. 39, no. 6, pp. 2176-2188, 2010.
20. C. Dürr and N. K. Thang, "Nash equilibria in voronoi games on graphs", in Algorithms-ESA 2007. Springer, 2007, pp. 17-28.
21. M. R. Garey and D. S. Johnson, "Complexity results for multiprocessor scheduling under resource constraints", SIAM Journal on Computing, vol. 4, no. 4, pp. 397-411, 1975.