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 language | American English |
---|---|
Pages (from-to) | 363-380 |
Number of pages | 18 |
Journal | Internet Mathematics |
Volume | 12 |
Issue number | 6 |
DOIs | |
State | Published - 1 Nov 2016 |
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computational Mathematics
- Applied Mathematics