Multi-player Diffusion Games on Graph Classes

Laurent Bulteau (1) , Vincent Froese (1) , Nimrod Talmon (1)

1 SWT - TUB - Department of Software Engineering and Theoretical Computer Science

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 [7] for two players, we investigate the existence of pure Nash equilibria for at least three players on different classes of graphs including paths, cycles, and grid graphs. As a main result, we answer an open question proving that there is no Nash equilibrium for three players on m × n grids with min{m, n} ≥ 5.

Domaines: Algorithme et structure de données [cs.DS]; Bio-informatique [q-bio.QM]; Complexité [cs.CC]

Laurent Bulteau, Vincent Froese, Nimrod Talmon. Multi-player Diffusion Games on Graph Classes. TAMC, May 2015, Singapore, Singapore. ⟨10.1007/978-3-319-17142-5_18⟩. ⟨hal-01260620⟩