Near-optimal network design with selfish agents
- 9 June 2003
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 511-520
- https://doi.org/10.1145/780542.780617
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Selfish behavior and stability of the internet:Published by Association for Computing Machinery (ACM) ,2002
- Selfish traffic allocation for server farmsPublished by Association for Computing Machinery (ACM) ,2002
- Sharing the Cost of Multicast TransmissionsJournal of Computer and System Sciences, 2001
- Algorithms, games, and the internetPublished by Association for Computing Machinery (ACM) ,2001
- Stackelberg scheduling strategiesPublished by Association for Computing Machinery (ACM) ,2001
- The price of selfish routingPublished by Association for Computing Machinery (ACM) ,2001
- A threshold of ln n for approximating set cover (preliminary version)Published by Association for Computing Machinery (ACM) ,1996
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, 1995
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- Making greed work in networks: a game-theoretic analysis of switch service disciplinesIEEE/ACM Transactions on Networking, 1995