Multi-Player Diffusion Games on Graph Classes

Laurent Bulteau, Vincent Froese, Nimrod Talmon

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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 equilibriafor 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 equilibriumfor three players on m × 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 equilibriafor four players on every d-dimensional hypercube.

Original languageEnglish
Pages (from-to)363-380
Number of pages18
JournalInternet Mathematics
Volume12
Issue number6
DOIs
StatePublished - 1 Nov 2016
Externally publishedYes

Fingerprint

Dive into the research topics of 'Multi-Player Diffusion Games on Graph Classes'. Together they form a unique fingerprint.

Cite this