The price of anarchy in network creation games is (mostly) constant
From MaRDI portal
Publication:372985
DOI10.1007/S00224-013-9459-YzbMath1293.91031OpenAlexW2755645987MaRDI 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
Nash equilibriumprice of anarchynetwork creation games\textsc{MaxGame}\textsc{SumGame}equilibrium graph
Related Items (16)
The Price of Anarchy in Network Creation Games Is (Mostly) Constant ⋮ Tree Nash Equilibria in the Network Creation Game ⋮ Anarchy Is Free in Network Creation ⋮ On the Tree Conjecture for the Network Creation Game ⋮ Network Creation Games with Local Information and Edge Swaps ⋮ 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 ⋮ The Impact of Cooperation in Bilateral Network Creation ⋮ 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 ⋮ Distance-Uniform Graphs with Large Diameter ⋮ Inequality and Network Formation Games ⋮ On the price of anarchy for high-price links
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
This page was built for publication: The price of anarchy in network creation games is (mostly) constant
