Automata, Languages and Programming
From MaRDI portal
Publication:5716801
DOI10.1007/11523468zbMath1084.90044WikidataQ56656999 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
90C35: Programming involving graphs or networks
91A10: Noncooperative games
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On the hardness of network design for bottleneck routing games, Efficient methods for selfish network design, The price of atomic selfish ring routing, Stability vs. optimality in selfish ring routing, How much can taxes help selfish routing?, On the severity of Braess's paradox: designing networks for selfish users is hard