The price of selfish routing
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 510-519
- https://doi.org/10.1145/380752.380846
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- The designer's perspective to atomic noncooperative networksIEEE/ACM Transactions on Networking, 1999
- Virtual path bandwidth allocation in multiuser networksIEEE/ACM Transactions on Networking, 1997
- Achieving network optima using Stackelberg routing strategiesIEEE/ACM Transactions on Networking, 1997
- Architecting noncooperative networksIEEE Journal on Selected Areas in Communications, 1995
- On the existence of equilibria in noncooperative optimal flow controlJournal of the ACM, 1995
- Flow control using the theory of zero sum Markov gamesIEEE Transactions on Automatic Control, 1994
- Competitive routing in multiuser communication networksIEEE/ACM Transactions on Networking, 1993
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952
- Non-Cooperative GamesAnnals of Mathematics, 1951