Which is the worst-case Nash equilibrium?

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

Volumn 2747, Issue , 2003, Pages 551-561

  Lücking, Thomas ^a   Mavronicolas, Marios ^b   Monien, Burkhard ^a   Rode, Manuel ^a,f   Spirakis, Paul ^c,d   Vrto, Imrich ^e  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF CYPRUS   (Cyprus)

^c University of Patras and Computer Technology Institute   (Greece)

^d UNIVERSITY OF PATRAS   (Greece)

^e INSTITUTE OF CHEMISTRY   (Slovakia)

^f Graduate School of Dynamic Intelligent Systems   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GAME THEORY; NETWORK ROUTING;

MIXED STRATEGY; NASH EQUILIBRIA; PARALLEL LINKS; POSITIVE PROBABILITY; ROUTING NETWORKS; ROUTING STRATEGIES; SELFISH ROUTING; SOCIAL COST;

TELECOMMUNICATION NETWORKS;

EID: 35248876216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_49     Document Type: Article

References (16)

1. A. Czumaj and B. Vöcking, "Tight Bounds for Worst-Case Equilibria", Proceedings of the 13th Annual ACM Symposium on Discrete Algorithms, pp. 413-420, 2002.
2. R. Feldmann, M. Gairing, T. Lücking, B. Monien and M. Rode, "Nashification and the Coordination Ratio for a Selfish Routing Game", 30th International Colloquium on Automata, Languages and Programming, 2003.
3. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas and P. Spirakis, "The Structure and Complexity of Nash Equilibria for a Selfish Routing Game,' Proceedings of the 29th International Colloquium on Automata, Languages and Programming, LNCS 2380, pp. 123-134, 2002.
4. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien and P. Spirakis, "Extreme Nash Equilibria", submitted for publication, March 2003. Also available as Technical Report FLAGS-TR-02-5, Computer Technology Institute, Patras, Greece, November 2002.
5. T. Gonzalez, O.H. Ibarra and S. Sahni, "Bounds for LPT schedules on uniform processors", SIAM Journal on Computing, Vol. 6, No. 1, pp. 155-166, 1977.
6. R. L. Graham, "Bounds on Multiprocessing Timing Anomalies", SIAM Journal on Applied Mathematics, Vol. 17, pp. 416-426, 1969.
7. E. Horowitz and S. Sahni, "Exact and aproximate algorithms for scheduling non-identical processors", Journal of the Association of Computing Machinery, Vol. 23, No. 2, pp. 317-327, 1976.
8. E. Koutsoupias, M. Mavronicolas and P. Spirakis, "Approximate Equilibria and Ball Fusion", Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, 2002, accepted to Theory of Computing Systems.
9. E. Koutsoupias and C. H. Papadimitriou, "Worst-case Equilibria", Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1563, pp. 404-413, 1999.
10. M. Mavronicolas and P. Spirakis, "The Price of Selfish Routing", Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 510-519, 2001.
11. H. Moulin and L. Vial, "Strategically Zero-Sum Games: The Class of Games whose Completely Mixed Equilibria Cannot be Improved Upon", International Journal of Game Theory, Vol. 7, Nos. 3/4, pp. 201-221, 1978.
12. J. F. Nash, "Equilibrium Points in N-Person Games", Proceedings of the National Academy of Sciences, Vol. 36, pp. 48-49, 1950.
13. J. F. Nash, "Non-cooperative Games", Annals of Mathematics, Vol. 54, No. 2, pp. 286-295, 1951.
14. M. J. Osborne and A. Rubinstein, A Course in Game Theory, MIT Press, 1994.
15. C. H. Papadimitriou, "Algorithms, Games and the Internet", Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 749-753, 2001.
16. T. E. S. Raghavan, "Completely Mixed Strategies in Bimatrix Games", Journal of London Mathematical Society, Vol. 2, No. 2, pp. 709-712, 1970.