Network load games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 809-818

  Caragiannis, Ioannis ^a   Galdi, Clemente ^a,b   Kaklamanis, Christos ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; PARALLEL PROCESSING SYSTEMS; ROUTERS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

COMPUTING EQUILIBRIA; NETWORK LOAD GAMES; PARALLEL LINKS; PURE NASH EQUILIBRIA;

GAME THEORY;

EID: 33744957200     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_81     Document Type: Conference Paper

References (16)

1. R.K. Ahuja, T.L. Magnati, and J.B. Orlin. Network flows, Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. A. Björklund, T. Husfeldt, and S. Khanna. Approximating longest directed paths and cycles. In Proceedings of the 31st International Colloquium on Automata, Languages, and Programming (ICALP '04), LNCS 3142, Springer, pp. 222-233, 2004.
3. A. Fabrikant, C. Papadimitriou, and K. Talwar. The complexity of pure nash equilibria. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC '04), pp. 604-612, 2004.
4. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Nashification and the coordination ratio for a selfish routing game. In Proceedings of the 30th International Colloquium on Automata, Language, and Programming (ICALP '03), LNCS 2719, Springer, pp. 514-526, 2003.
5. 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 International Colloquium on Automata, Language, and Programming (ICALP '02), LNCS 2380, Springer, pp. 123-134, 2002.
6. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flows. In Proceedings of the 31st International Colloquium on Automata, Language, and Programming (ICALP '04), LNCS 3142, Springer, pp. 593-605, 2004.
7. M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien. Computing Nash equilibria for restricted parallel links. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC '04), pp. 613-622, 2004.
8. D.S. Hochbaum and D. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing, 17(3), pp. 539-551, 1988.
9. J. Kleinberg. Single-source unsplittable flow. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS '97), pp. 68-77, 1996.
10. S. Kolliopoulos and C. Stein. Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing, 31, pp. 919-946, 2002.
11. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS '99), LNCS 1563, Springer, pp. 404-413, 1999.
12. D. Monterer and L. S. Shapley. Potential games. Games and Economic Behavior, Vol. 14, pp. 124-143, 1996.
13. J. F. Nash. Non-cooperative games. Annals of Mathematics, 54(2), pp. 286-295, 1951.
14. R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, Vol. 2, pp. 65-67, 1973.
15. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2), pp. 236-259, 2002.
16. M. Yannakakis and F. Gavril. Edge dominating sets in graphs. SIAM Journal on Applied Mathematics, Vol. 38(3), pp. 364-372, 1980.