The price of selfish routing

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 510-519

  Mavronicolas, Marios ^a   Spirakis, Paul ^b  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); GAME THEORY; PROBABILITY DISTRIBUTIONS; TELECOMMUNICATION LINKS; THEOREM PROVING;

ROUTING PROBLEMS;

TELECOMMUNICATION TRAFFIC;

EID: 0034832010     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380846     Document Type: Conference Paper

References (37)

1. Flow control using the theory of zero-sum markov games
2. Competitive routing in networks with polynomial cost
3. Fast probabilistic algorithms for hamiltonian circuits and matchings
4. Dynamic Noncooperative Game Theory
5. Intelligent network overview
6. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
7. Inefficiency of nash equilibria
8. Multi-objective routing in integrated services networks: A game theory approach
9. Sharing the cost of multicast transactions
10. Probabilistic Methods in Algorithmic Discrete Mathematics
11. Optimal decentralized flow control of markovian queueing networks with multiple controllers
12. Optimization problems in congestion control
13. On the existence of equilibria in noncooperative optimal flow control
14. Architecting noncooperative networks
15. Achieving network optima using stackelberg routing strategies
16. Capacity allocation under noncooperative routing
17. Avoiding the braess paradox in non-cooperative networks
18. Worst-case equilibria
19. Virtual path bandwidth allocation in multi-user networks
20. The designer's perspective to atomic noncooperative networks
21. Computation of equilibria in finite games
22. Non-cooperative games
23. Competitive routing in multiuser communication networks
24. On the approximability of trade-offs and optimal access of web sources
25. How bad is selfish routing?
26. Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment