Basic network creation games

DOI10.1137/090771478MaRDI QIDQ2848528zbMATH OpenOpenAlexFDO

Authors Noga Alon, Erik D. Demaine, Tom Leighton, Mohammad T. Hajiaghayi

Publication date 26 September 2013

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.391.5161

zbMATH Keywords

equilibriumlow diameternetwork creationnetwork designprice of anarchy

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) (n)-person games, (n>2) (91A06)

Recommendations

• A bounded budget network creation game
• On the Structure of Equilibria in Basic Network Formation
• On the structure of equilibria in basic network formation
• The price of anarchy in network creation games is (mostly) constant
• The price of anarchy in network creation games

Cited in

(36)

• 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
• Geometric spanner games
• On the structure of equilibria in basic network formation
• Dynamics in tree formation games
• On selfish creation of robust networks
• On network formation games with heterogeneous players and basic network creation games
• Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games
• Correction: ``Basic network creation games
• Network creation games: think global -- act local
• On dynamics in basic network creation games
• Celebrity games
• The Price of Anarchy in Network Creation Games Is (Mostly) Constant
• On the tree conjecture for the network creation game
• Efficient equilibrium concepts in non-cooperative network formation
• Basic network creation games with communication interests
• A bounded budget network creation game
• Inequality and network formation games
• Network formation for asymmetric players and bilateral contracting
• On the Complexity of Local Graph Transformations
• Network Creation Games with Local Information and Edge Swaps
• Network movement games
• Distance-uniform graphs with large diameter
• The price of anarchy in cooperative network creation games
• Network creation games with traceroute-based strategies
• An improved bound for the tree conjecture in network creation games
• On tree equilibria in max-distance network creation games
• Geometric Network Creation Games
• On the PoA Conjecture: Trees versus Biconnected Components
• On bipartite sum basic equilibria
• The diameter of sum basic equilibria games
• One n remains to settle the tree conjecture
• Swap equilibria under link and vertex destruction
• Some results of Maria Serna on strategic games: complexity of equilibria and models
• Friend of my friend: network formation with two-hop benefit

This page was built for publication: Basic network creation games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848528)