Multi-player diffusion games on graph classes

DOI10.1007/978-3-319-17142-5_18MaRDI QIDQ2948467zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Laurent Bulteau, Vincent Froese, Nimrod Talmon

Publication date 30 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.2544

zbMATH Keywords

competitive diffusion games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) (n)-person games, (n>2) (91A06) Noncooperative games (91A10) Games involving graphs (91A43) Social networks; opinion dynamics (91D30)

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 equilibria for 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 equilibrium for three players on (m x 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 equilibria for four players on every d-dimensional hypercube.

Recommendations

• Multi-Player Diffusion Games on Graph Classes
• The competitive diffusion game in classes of graphs
• Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium
• The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
• Pure Nash equilibria of competitive diffusion process on toroidal grid graphs

Cites work

• A comment on pure-strategy Nash equilibria in competitive diffusion games
• A note on competitive diffusion through social networks
• Finding safe strategies for competitive diffusion on trees
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• Nash equilibria for competitive information diffusion on trees
• Nash Equilibria in Voronoi Games on Graphs
• The competitive diffusion game in classes of graphs
• Voronoi Games on Cycle Graphs

Cited in

(13)

• Pure-strategy Nash equilibria on competitive diffusion games
• Nash equilibria for competitive information diffusion on trees
• Complexity of equilibrium in competitive diffusion games on social networks
• Pure Nash equilibria of competitive diffusion process on toroidal grid graphs
• Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium
• Competitive diffusion on weighted graphs
• Finding safe strategies for competitive diffusion on trees
• Nash equilibria for information diffusion games on weighted cycles and paths
• The competitive diffusion game in classes of graphs
• ChoiceGAPs: competitive diffusion as a massive multi-player game in social networks
• Multi-Player Diffusion Games on Graph Classes
• The one-round multi-player discrete Voronoi game on grids and trees
• A note on competitive diffusion through social networks

This page was built for publication: Multi-player diffusion games on graph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948467)