Automata, Languages and Programming
From MaRDI portal
Publication:5716801
DOI10.1007/11523468zbMath1084.90044OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716801
Henry W. Lin, Asher Walkover, Tim Roughgarden, Éva Tardos
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Programming involving graphs or networks (90C35) Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
On the hardness of network design for bottleneck routing games ⋮ Efficient methods for selfish network design ⋮ Stability vs. optimality in selfish ring routing ⋮ The price of atomic selfish ring routing ⋮ How much can taxes help selfish routing? ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard
This page was built for publication: Automata, Languages and Programming
