On the PoA Conjecture: Trees versus Biconnected Components

DOI10.1137/21M1466426MaRDI QIDQ6157979zbMATH OpenWikidataFDO

Authors Carme Àlvarez

Publication date 22 June 2023

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

Full work available at URL https://doi.org/10.1137/21M1466426

zbMATH Keywords

Nash equilibrianetwork creation gameprice of anarchy

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

• A bounded budget network creation game
• An improved bound for the tree conjecture in network creation games
• Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games
• Basic network creation games
• Distance-uniform graphs with large diameter
• On a network creation game
• On nash equilibria for a network creation game
• On the tree conjecture for the network creation game
• The price of anarchy in network creation games
• The price of anarchy in network creation games is (mostly) constant

Cited in

(3)

• scientific article; zbMATH DE number 4168710 (Why is no real title available?)
• Network creation games with 2-neighborhood maximization
• One n remains to settle the tree conjecture

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

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