Further Results on Capacitated Network Design Games

DOI10.1007/978-3-662-48433-3_5zbMath1358.91030OpenAlexW2182203805MaRDI QIDQ3449582

Erlebach, Thomas, Matthew Radoja

Publication date: 4 November 2015

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2381/32808

Mathematics Subject Classification ID

Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items (1)

Non-cooperative capacitated facility location games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
• Potential games
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Capacitated Network Design Games
• Algorithmic Game Theory

This page was built for publication: Further Results on Capacitated Network Design Games