The Hardness of Selective Network Design for Bottleneck Routing Games

DOI10.1007/978-3-540-72504-6_5MaRDI QIDQ5425420zbMATH OpenOpenAlexFDO

Authors Haiyang Hou, Guochuan Zhang

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_5

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Applications of game theory (91A80)

Recommendations

• On the hardness of network design for bottleneck routing games
• On the hardness of network design for bottleneck routing games
• Robust bottleneck routing games
• Efficient graph topologies in network routing games
• The inefficiency of Nash and subgame perfect equilibria for network routing
• Further results on capacitated network design games
• Improved bounds on equilibria solutions in the network design game
• scientific article; zbMATH DE number 7042410
• Approximating Congestion + Dilation in Networks via "Quality of Routing” Games
• The structure and complexity of Nash equilibria for a selfish routing game

Cited in

(2)

• On the hardness of network design for bottleneck routing games
• On the hardness of network design for bottleneck routing games

This page was built for publication: The Hardness of Selective Network Design for Bottleneck Routing Games

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