Multi-player Diffusion Games on Graph Classes

DOI10.1007/978-3-319-17142-5_18zbMath1462.05252arXiv1412.2544OpenAlexW2595611625WikidataQ62039074 ScholiaQ62039074MaRDI QIDQ2948467

Nimrod Talmon, Vincent Froese, Laurent Bulteau

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

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

Related Items (2)

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium ⋮ The one-round multi-player discrete Voronoi game on grids and trees

Cites Work

• Unnamed Item
• A comment on pure-strategy Nash equilibria in competitive diffusion games
• A note on competitive diffusion through social networks
• Nash equilibria for competitive information diffusion on trees
• Nash Equilibria in Voronoi Games on Graphs
• Voronoi Games on Cycle Graphs
• Finding Safe Strategies for Competitive Diffusion on Trees
• The Competitive Diffusion Game in Classes of Graphs

This page was built for publication: Multi-player Diffusion Games on Graph Classes