Finding Safe Strategies for Competitive Diffusion on Trees
From MaRDI portal
Publication:4985784
DOI10.1080/15427951.2014.977407zbMath1465.91078arXiv1404.5356OpenAlexW2031620091MaRDI QIDQ4985784
Celeste Vautour, Jeannette C. M. Janssen
Publication date: 26 April 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.5356
Social networks; opinion dynamics (91D30) Noncooperative games (91A10) Applications of game theory (91A80)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Spiders are status unique in trees
- A comment on pure-strategy Nash equilibria in competitive diffusion games
- A note on competitive diffusion through social networks
- Some properties of a centroid of a free tree
- Another characterization of the centroid of a tree
- Nash equilibria for competitive information diffusion on trees
- Information diffusion on the iterated local transitivity model of online social networks
- The Voronoi game on graphs and its complexity
- On the Approximability of Influence in Social Networks
- Voronoi Game on Graphs
- The Competitive Diffusion Game in Classes of Graphs
- Competitive contagion in networks
- Equilibrium points in n -person games