Self-organizing flows in social networks
From MaRDI portal
Publication:2345453
DOI10.1016/j.tcs.2015.02.018zbMath1320.91120OpenAlexW1963543105MaRDI QIDQ2345453
Laurent Viennot, Laurent Massoulié, Nidhi Hegde
Publication date: 22 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.018
Social networks; opinion dynamics (91D30) Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded budget betweenness centrality game for strategic network formations
- Nearest neighbor queries in metric spaces
- Accessing nearby copies of replicated objects in a distributed environment
- Potential games
- A class of games possessing pure-strategy Nash equilibria
- On a network creation game
- Finding nearest neighbors in growth-restricted metrics
- The complexity of pure Nash equilibria
- A Noncooperative Model of Network Formation
- Fast construction of nets in low dimensional metrics, and their applications
- Tight Bounds for Rumor Spreading with Vertex Expansion
- Algorithmic Game Theory
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
This page was built for publication: Self-organizing flows in social networks
