Multi-Player Diffusion Games on Graph Classes
M.Sc. Nimrod Talmon (TU Berlin)
We study competitive diffusion games on graphs introduced by Alon
et al. [IPL 2010] to model the spread of influence in social networks.
Extending results of Roshanbin [AAIM 2014] 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 for m
and n at least 5.
Back to the research colloquium site.