The price of anarchy in network creation games is (mostly) constant

DOI10.1007/s00224-013-9459-yzbMath1293.91031MaRDI QIDQ372985

Matúš Mihalák, Jan Christoph Schlegel

Publication date: 21 October 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/423113

zbMATH Keywords

Nash equilibrium; price of anarchy; network creation games; \textsc{MaxGame}; \textsc{SumGame}; equilibrium graph

Mathematics Subject Classification ID

91A10: Noncooperative games

91A43: Games involving graphs

91A06: (n)-person games, (n>2)

Related Items

Inequality and Network Formation Games, Network Creation Games with Local Information and Edge Swaps, Distance-Uniform Graphs with Large Diameter, Social distancing network creation, An improved bound for the tree conjecture in network creation games, On tree equilibria in max-distance network creation games, On the PoA Conjecture: Trees versus Biconnected Components, On the price of anarchy for high-price links, On network formation games with heterogeneous players and basic network creation games, On the tree conjecture for the network creation game, The max-distance network creation game on general host graphs, Tree Nash Equilibria in the Network Creation Game, Anarchy Is Free in Network Creation, The Price of Anarchy in Network Creation Games Is (Mostly) Constant, On the Tree Conjecture for the Network Creation Game

Cites Work

• Unnamed Item
• Unnamed Item
• A strategic model of social and economic networks
• Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games
• On a network creation game
• A Clustering Coefficient Network Formation Game
• On Dynamics in Basic Network Creation Games
• The price of anarchy in network creation games
• On nash equilibria for a network creation game
• The Max-Distance Network Creation Game on General Host Graphs