Multi-player diffusion games on graph classes

Laurent Bulteau, Vincent Froese, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings
EditorsRahul Jain, Sanjay Jain, Frank Stephan
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783319171418
StatePublished - 1 Jan 2015
Externally publishedYes
Event12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015 - Singapore, Singapore
Duration: 18 May 201520 May 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Multi-player diffusion games on graph classes'. Together they form a unique fingerprint.

Cite this