Tradeoffs in worst-case equilibria
- 1 September 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 361 (2-3), 200-209
- https://doi.org/10.1016/j.tcs.2006.05.010
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The price of anarchy is independent of the network topologyJournal of Computer and System Sciences, 2003
- How much can taxes help selfish routing?Published by Association for Computing Machinery (ACM) ,2003
- Pricing network edges for heterogeneous selfish usersPublished by Association for Computing Machinery (ACM) ,2003
- How bad is selfish routing?Journal of the ACM, 2002
- Selfish traffic allocation for server farmsPublished by Association for Computing Machinery (ACM) ,2002
- Algorithms, games, and the internetPublished by Association for Computing Machinery (ACM) ,2001
- The price of selfish routingPublished by Association for Computing Machinery (ACM) ,2001
- Designing networks for selfish users is hardPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Worst-Case EquilibriaLecture Notes in Computer Science, 1999