The price of anarchy in network creation games

DOI10.1145/1281100.1281142zbMath1283.68053OpenAlexW2121143261MaRDI QIDQ5401424

Morteza Zadimoghaddam, Erik D. Demaine, Hamid Mahini, Mohammad Taghi Hajiaghayi

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1721.1/121367

zbMATH Keywords

Nash equilibriumnetwork designroutingprice of anarchy

Mathematics Subject Classification ID

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

Related Items (14)

The Price of Anarchy in Network Creation Games Is (Mostly) Constant ⋮ Dynamics in tree formation games ⋮ On the PoA Conjecture: Trees versus Biconnected Components ⋮ Friend of my friend: network formation with two-hop benefit ⋮ Topological implications of selfish neighbor selection in unstructured peer-to-peer networks ⋮ Network formation for asymmetric players and bilateral contracting ⋮ Network movement games ⋮ The Price of Anarchy of a Network Creation Game with Exponential Payoff ⋮ Non-cooperative tree creation ⋮ Bounded budget connection (BBC) games or how to make friends and influence people, on a budget ⋮ On the Complexity of Local Graph Transformations ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ On the price of anarchy for high-price links ⋮ On the structure of equilibria in basic network formation

This page was built for publication: The price of anarchy in network creation games