Fast convergence of selfish rerouting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 772-781

  Even Dar, Eyal ^a   Mansour, Yishay ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FAST CONVERGENCE; NASH EQUILIBRIUM; SELFISH REROUTING;

ALGORITHMS; COMPUTER SCIENCE; DECISION MAKING; PROBABILITY; PUBLIC POLICY; ROUTERS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 20744448378     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. Alpern and D. Reyniers, "Spatial Dispersion as a Dynamic Coordination Problem", Theory & Decision 53:1, pp. 29-59, 2002.
2. D. Angluin and L. G. Valiant. Fast probabilistic algorithms for hamiltonian circuits and matchings. Journal of Computer and System Sciences, 18:155-193, 1979.
3. B. Awerbuh, Y. Azar, and Y. Richter, "Analysis of worse case Nash equilibria for restricted assignment", WOWA 2003.
4. L. E. J. Brouwer. Uber abbildung von mannigfaltigkeiten. Mathematische Annalen, 71:97-115, 1912.
5. A. Czumaj, P. Krysta and B. Vocking, "Selfish traffic allocation for server farms," in Proceedings of the 34th Symposium on Theory of Computing,pp. 287-296, 2002.
6. A. Czumaj and B. Vocking, "Tight bounds on worse case equilibria", In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 413-420, 2002.
7. Devdatt P. Dubhashi and Desh Ranjan. Balls and bins: A study in negative dependence, Random Structures and Algorithms, 13:2, pp. 99-124, 1998.
8. E. Even-Dar, A. Kesselman and Y. Mansour, "Convergence Time To Nash Equilibria," In Proceedings of the 30th ICALP, pp. 502-513, 2003.
9. Paul Goldberg, "Bounds for the convergence rate of randomized local search in multiplayer games, uniform resource sharing game", In Proceedings of the Twenty-Third PODC, pp. 131-140, 2004.
10. T. Grenager, R. Powers and Y. Shoham, "Dispersion games: general definitions and some specific learning results", In Eighteenth national conference on Artificial intelligence, pp 398-403, 2002.
11. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis, "The Structure and Complexity of Nash Equilibria for a Selfish Routing Game," In Proceedings of the 29th ICALP, Malaga, pp 123-134, 2002.
12. E. Koutsoupias, C. H. Papadimitriou, "Worst-case equilibria,"in Proceedings of 16th STAGS, pp. 404-413, 1999.
13. L. Libman and A. Orda, "Atomic Resource Sharing in Noncooperative Networks", Telecommunication Systems, 17:4, pp 385-409, 2001.
14. P. Marbach "Priority service and max-miri fairness", IEEE/ACM Trans. Netw., 11:5, pp 733-746, 2003.
15. M. Mitzenmacher, A. Richa and R. Sitaraman, "The power of two random choices: A survey of the techniques and results". In Handbook of Randomzied Computing, Rajasekaran et al., Kluuwer Academic Press, 2000.
16. V. Mirrokni and A. Vetta, "Convergence issues in competitive games", In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization, 2004.
17. J. F. Nash, "Non-cooperative games," Annals of Mathematics, Vol. 54, pp. 286-295, 1951.
18. A. Orda, R. Rom and N. Shimkin, "Competitive routing in multi-user communication networks," IEEE/ACM Transaction on Networking, Vol 1, pp. 614-627, 1993.
19. T. Roughgarden and E, Tardos, "How Bad is Selfish Routing?," Journal of the ACM, 49(2):236-259, 2002.