The structure and complexity of Nash equilibria for a selfish routing game

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

Volumn 2380 LNCS, Issue , 2002, Pages 123-134

  Fotakis, Dimitris ^a   Kontogiannis, Spyros ^a   Koutsoupias, Elias ^b,c   Mavronicolas, Marios ^d   Spirakis, Paul ^a,e  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b University of California   (United States)

^c UNIVERSITY OF ATHENS   (Greece)

^d UNIVERSITY OF CYPRUS   (Cyprus)

^e UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPLEX NETWORKS; HARDNESS; PROBABILITY DISTRIBUTIONS;

ALGORITHMIC PROBLEMS; COMBINATORIAL STRUCTURES; HARDNESS RESULT; MIXED STRATEGY; NASH EQUILIBRIA; NETWORK CONGESTIONS; SELFISH ROUTING; SYSTEMATIC STUDY;

GAME THEORY;

EID: 84869168491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_12     Document Type: Conference Paper

References (19)

1. A. Czumaj and B. Vöcking, "Tight Bounds forWorst-Case Equilibria", Proceedings of the 13th Annual ACM Symposium on Discrete Algorithms, January 2002.
2. X. Deng, C. Papadimitriou and S. Safra, "On the Complexity of Equilibria", Proceedings of the 34th Annual ACM Symposium on Theory of Computing, May 2002.
3. I. Gilboa and E. Zemel, "Nash and Correlated Equilibria: Some Complexity Considerations", Games and Economic Behavior, Vol. 1, pp. 80-93, 1989.
4. R. L. Graham, "Bounds on Multiprocessing Timing Anomalies," SIAM Journal on Applied Mathematics, Vol. 17, pp. 416-429, 1969.
5. G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes, Oxford Science Publications, Second Edition, 1992.
6. E. Koutsoupias, M. Mavronicolas and P. Spirakis, "Approximate Equilibria and Ball Fusion," Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, June 2002.
7. E. Koutsoupias and C. H. Papadimitriou, "Worst-case Equilibria," Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, LNCS 1563, pp. 404-413, 1999.
8. C. E. Lemke and J. T. Howson, "Equilibrium Points of Bimatrix Games," Journal of the Society for Industrial and Applied Mathematics, Vol. 12, pp. 413-423, 1964.
9. 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.
10. R. D. McKelvey and A. McLennan, "Computation of Equilibria in Finite Games," in Handbook of Computational Economics, H. Amman, D. Kendrick and J. Rust eds., pp. 87-142, 1996.
11. N. Megiddo, "A Note on the Complexity of P-Matrix LCP and Computing an Equilibrium," Research Report RJ6439, IBM Almaden Research Center, San Jose, CA95120, 1988.
12. N. Megiddo and C. H. Papadimitriou, "On Total Functions, Existence Theorems, and Computational Complexity," Theoretical Computer Science, Vol. 81, No. 2, pp. 317-324, 1991.
13. B. Monien, Personal Communication, April 2002.
14. J. F. Nash, "Non-cooperative Games," Annals of Mathematics, Vol. 54, No. 2, pp. 286-295, 1951.
15. M. J. Osborne and A. Rubinstein, A Course in Game Theory, MIT Press, 1994.
16. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
17. C. H. Papadimitriou, "On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence," Journal of Computer and System Sciences, Vol. 48, No. 3, pp. 498-532, June 1994.
18. C. H. Papadimitriou, "Algorithms, Games and the Internet," Proceedings of the 28th International Colloquium on Automata, Languages and Programming, LNCS 2076, pp. 1-3, 2001.
19. B. von Stengel, "Computing Equlibria for Two-Person Games," in Handbook of Game Theory, Vol. 3, R. J. Aumann and S. Hart eds., North Holland, 1998.