Multi-player Diffusion Games on Graph ClassesReport as inadecuate

Multi-player Diffusion Games on Graph Classes - Download this document for free, or read online. Document in PDF available to download.

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

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 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.

Author: Laurent Bulteau - Vincent Froese - Nimrod Talmon -



Related documents