Abstract
One of the widely studied models in social networks is the diffusion model, where the goal is to propagate a certain type of product or behavior in a desired way through the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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.
S. R. Etesami and T. Başar, “Complexity of equilibrium in competitive diffusion games on social networks,” Automatica, vol. 68, pp. 100–110, 2016.
S. R. Etesami and T. Başar, “Complexity of equilibrium in diffusion games on social networks,” Proc. 2014 American Control Conference (ACC 2014), Portland, OR, June 4–6, 2014, pp. 2077–2082, 2014.
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.
L. Small and O. Mason, “Information diffusion on the iterated local transitivity model of online social networks,” Discrete Applied Mathematics, 2012.
R. Takehara, M. Hachimori, and M. Shigeno, “A comment on pure-strategy Nash equilibria in competitive diffusion games,” Information Processing Letters, vol. 112, no. 3, pp. 59–60, 2012.
L. Small and O. Mason, “Nash equilibria for competitive information diffusion on trees,” Information Processing Letters, vol. 113, no. 7, pp. 217–219, 2013.
C. Dürr and N. K. Thang, “Nash equilibria in Voronoi games on graphs,” in Algorithms-ESA 2007. Springer, 2007, pp. 17–28.
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.
K. Paton, “An algorithm for the blocks and cutnodes of a graph,” Communications of the ACM, vol. 14, no. 7, pp. 468–475, 1971.
P. Erdos and A. Renyi, “On random graphs I,” in Publ. Math. Debrecen, vol. 6, 1959, pp. 290–297.
B. Hajek, Y. Wu, and J. Xu, “Computational lower bounds for community detection on random graphs,” arXiv preprint arXiv:1406.6625, 2014.
M. E. J. Newman, “Detecting community structure in networks,” Eur. Phys. J. B, vol. 38, pp. 321–330, 2004.
F. Wu and B. A. Huberman, “Finding communities in linear time: A physics approach,” in http://arxiv.org/abs/cond-mat/0310600, 2003.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Etesami, S.R. (2017). Diffusion Games over Social Networks. In: Potential-Based Analysis of Social, Communication, and Distributed Networks. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-54289-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-54289-8_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54288-1
Online ISBN: 978-3-319-54289-8
eBook Packages: EngineeringEngineering (R0)