On the PoA Conjecture: Trees versus Biconnected Components

DOI10.1137/21M1466426WikidataQ123117649 ScholiaQ123117649MaRDI QIDQ6157979FDOQ6157979

Authors: 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

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

Cited In (1)

• Title not available (Why is that?)

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)