On the Price of Stability for Undirected Network Design

DOI10.1007/978-3-642-12450-1_8zbMath1284.68277OpenAlexW1583864908MaRDI QIDQ3558916

Rob van Stee, George Christodoulou, Christine Chung, Evangelia Pyrga, Katrina Ligett

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.conncoll.edu/cgi/viewcontent.cgi?article=1005&context=comscifacpub

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (13)

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games ⋮ Improved lower bounds on the price of stability of undirected network design games ⋮ Social context congestion games ⋮ Timing matters: online dynamics in broadcast games ⋮ On the Price of Stability of Undirected Multicast Games ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ The ring design game with fair cost allocation ⋮ Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games ⋮ Designing cost-sharing methods for Bayesian games ⋮ Improved bounds on equilibria solutions in the network design game ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ A Characterization of Undirected Graphs Admitting Optimal Cost Shares ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games

This page was built for publication: On the Price of Stability for Undirected Network Design