Network movement games

DOI10.1016/j.tcs.2016.12.029zbMath1359.68017OpenAlexW2569002229MaRDI QIDQ511922

Gianpiero Monaco, Michele Flammini, Vasco Gallotti, Giovanna Melideo, Luca Moscardelli

Publication date: 22 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.029

zbMATH Keywords

price of anarchyprice of stabilitynetwork creation gamesspeed of convergencemovement problems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43)

Related Items (1)

Some anomalies of farsighted strategic behavior

Cites Work

• Unnamed Item
• Unnamed Item
• Euclidean movement minimization
• On the performances of Nash equilibria in isolation games
• The isolation game: a game of distances
• Potential games
• A strategic model of social and economic networks
• Non-cooperative games
• Basic Network Creation Games
• Minimizing movement
• On a network creation game
• O(1)-Approximations for Maximum Movement Problems
• Minimizing movement in mobile facility location problems
• On the impact of combinatorial structure on congestion games
• Nash Equilibria in Voronoi Games on Graphs
• The complexity of pure Nash equilibria
• Minimizing Movement: Fixed-Parameter Tractability
• On the topologies formed by selfish peers
• The Price of Anarchy in Cooperative Network Creation Games
• The price of anarchy in network creation games
• Network formation games with local coalitions
• Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)

This page was built for publication: Network movement games