Competitive Diffusion on Weighted Graphs
DOI10.1007/978-3-319-21840-3_35zbMath1451.91029arXiv1412.3334OpenAlexW2408175436MaRDI QIDQ3449840
Akira Suzuki, Hisayuki Satoh, Yota Otachi, Kei Uchizawa, Xiao Zhou, Katsuhisa Yamanaka, Takehiro Ito, Ryuhei Uehara, Toshiki Saitoh
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3334
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of equilibrium in competitive diffusion games on social networks
- Scale free properties of random \(k\)-trees
- A comment on pure-strategy Nash equilibria in competitive diffusion games
- A note on competitive diffusion through social networks
- Competitive contagion in networks
- Nash equilibria for competitive information diffusion on trees
- Strategyproof mechanisms for competitive influence in networks
- Parametrized complexity theory.
- The Voronoi game on graphs and its complexity
- Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions
- Maximizing Influence in Competitive Environments: A Game-Theoretic Approach
- Nash Equilibria in Voronoi Games on Graphs
- Voronoi Games on Cycle Graphs
- Social Networks with Competing Products
- Automata, Languages and Programming
- Multi-Player Diffusion Games on Graph Classes
This page was built for publication: Competitive Diffusion on Weighted Graphs