On the PoA Conjecture: Trees versus Biconnected Components

DOI10.1137/21m1466426WikidataQ123117649 ScholiaQ123117649MaRDI QIDQ6157979

Unnamed Author, Carme Àlvarez

Publication date: 22 June 2023

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

zbMATH Keywords

Nash equilibriaprice of anarchynetwork creation game

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The price of anarchy in network creation games is (mostly) constant
• Basic Network Creation Games
• Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games
• Tree Nash Equilibria in the Network Creation Game
• On a network creation game
• On the Tree Conjecture for the Network Creation Game
• On nash equilibria for a network creation game
• A Bounded Budget Network Creation Game
• Distance-Uniform Graphs with Large Diameter
• The price of anarchy in network creation games
• An improved bound for the tree conjecture in network creation games

This page was built for publication: On the PoA Conjecture: Trees versus Biconnected Components