Multi-Player Diffusion Games on Graph Classes

Abstract : We study competitive diffusion games on graphs introduced by Alon et al. to model the spread of influence in social networks. Extending results of Roshanbin 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 for two players, we prove the existence of pure Nash equilibriafor four players on every d-dimensional hypercube.
Document type :
Journal articles
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
Contributor : Laurent Bulteau <>
Submitted on : Friday, March 24, 2017 - 1:00:52 PM
Last modification on : Thursday, July 5, 2018 - 2:45:52 PM
Long-term archiving on : Sunday, June 25, 2017 - 1:26:55 PM


Files produced by the author(s)



Laurent Bulteau, Vincent Froese, Nimrod Talmon. Multi-Player Diffusion Games on Graph Classes. Internet Mathematics, Taylor & Francis, 2016, 12 (6), pp.363 - 380. ⟨10.1080/15427951.2016.1197167⟩. ⟨hal-01494989⟩



Record views


Files downloads