Multi-Player Diffusion Games on Graph Classes

DOI10.1080/15427951.2016.1197167zbMath1461.91065OpenAlexW1930781581WikidataQ62039066 ScholiaQ62039066MaRDI QIDQ5856441

Nimrod Talmon, Laurent Bulteau, Vincent Froese

Publication date: 26 March 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2016.1197167

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Games involving graphs (91A43)

Related Items (3)

Competitive Diffusion on Weighted Graphs ⋮ The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality ⋮ Existence of pure Nash equilibria in 2-player information diffusion games with strict public preferences

Cites Work

• Unnamed Item
• Complexity of equilibrium in competitive diffusion games on social networks
• 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
• Competitive Diffusion on Weighted Graphs
• 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