2014/12/08 by Laurent Bulteau, Bulteau, Laurent, Vincent Froese +3
Decision Sciences · Physics and Astronomy · #91A06 #91A10 #91A24 #91A40 #91A43 #91A50 #Complex Network Analysis Techniques #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #G.2.2 #Game Theory and Applications #Opinion Dynamics and Social Influence
paper · pdf · doi:10.48550/arxiv.1412.2544
openalex publication_date 2014/12/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study competitive diffusion games on graphs introduced by Alon et al. [1] to model the spread of influence in social networks. Extending results of Roshanbin [8] for two players, we investigate the existence of pure Nash equilibria for at least three players on different classes of graphs including paths, cycles, grid graphs and hypercubes; as a main contribution, we answer an open question proving that there is no Nash equilibrium for three players on (m x n) grids with min(m, n) >= 5. Further, extending results of Etesami and Basar [3] for two players, we prove the existence of pure Nash equilibria for four players on every d-dimensional hypercube.