Extreme Nash equilibria

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

Volumn 2841, Issue , 2003, Pages 1-20

  Gairing, Martin ^a   Lucking, Thomas ^a   Mavronicolas, Marios ^b   Monien, Burkhard ^a   Spirakis, Paul ^c,d  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF CYPRUS   (Cyprus)

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

^d UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

NP-HARD; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS;

COMBINATORIAL STRUCTURES; COMPLEXITY RESULTS; MULTIPLICATIVE FACTORS; OBJECTIVE FUNCTIONS; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS; POSITIVE PROBABILITY; PURE NASH EQUILIBRIUM;

GAME THEORY;

EID: 0142218866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45208-9_1     Document Type: Article

References (30)

1. P. Brucker, J. Hurink and F. Werner, "Improving Local Search Heuristics for Some Scheduling Problems. Part II," Discrete Applied Mathematics, Vol. 72, No.1-2, pp. 47-69, 1997.
2. 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, January 2002.
3. X. Deng, C. Papadimitriou and S. Safra, "On the Complexity of Equilibria," Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 67-71, May 2002.
4. R. Feldmann, M. Gairing, T. Lücking, B. Monien and M. Rode, "Nashification and the Coordination Ratio for a Selfish Routing Game," Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pp. 514-526, Vol. 2719, Lecture Notes in Computer Science, Springer-Verlag, Eindhoven, The Netherlands, June/July 2003.
5. G. Finn and E. Horowitz, "A linear time approximation algorithm for multiprocessor scheduling," BIT, Vol. 19, pp. 312-320, 1979.
6. 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, pp. 123-134, Vol. 2380, Lecture Notes in Computer Science, Springer-Verlag, Malaga, Spain, July 2002.
7. M. R. Garey and D. S. Johnson, "Complexity Results for Multiprocessor Scheduling Under Resoiurce Constraints," SIAM Journal on Computing, Vol. 4, pp. 397-411, 1975.
8. M. R. Garey and D. S. Johnson, Computers and intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
9. G. H. Gonnet, "Expected Length of the Longest Probe Sequence in Hash Code Searching," Journal of the ACM, Vol. 28, No. 2, pp. 289-304, April 1981.
10. D. S. Hochbaum and D. Shmoys, "Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results," Journal of the ACM, Vol. 34, No. 1, pp. 144-162, 1987.
11. E. Horowitz and S. Sahni, "Exact and Approximate Algorithms for Scheduling Non-Identical Processors," Journal of the ACM, Vol. 23, No. 2, pp. 317-327, 1976.
12. R. M. Karp, "Reducibility among Combinatorial Problems," in R. E. Miller and J. W. Thatcher eds., Complexity of Computer Computations, pp. 85-103, Plenum Press, New York, 1972.
13. V. F. Kolchin, V. P. Chistiakov and B. A. Sevastianov, Random Allocations, V. H. Winston, New York, 1978.
14. E. Koutsoupias, M. Mavronicolas and P. Spirakis, "Approximate Equilibria and Ball Fusion," Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andres, Greece, June 2002.
15. Accepted to Theory of Computing Systems. Earlier version appeared as "A Tight Bound on Coordination Ratio," Technical Report 0100229, Department of Computer Science, University of California at Los Angeles, April 2001.
16. E. Koutsoupias and C. H. Papadimitriou, "Worst-case Equilibria," Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, G. Meinel and S. Tison eds., pp. 404-413, Vol. 1563, Lecture Notes in Computer Science, Springer-Verlag, Trier, Germany, March 1999.
17. T. Lücking, M. Mavronicolas, B. Monien, M. Rode, P. Spirakis and I. Vrto, "Which is the Worst-case Nash Equilibrium?" 26th International Symposium on Mathematical Foundations of Computer Science, August 2003, to appear.
18. A. Marshall and I. Olkin, Theory of Memorization and Its Applications, Academic Press, Orlando, FL, 1979.
19. M. Mavronicolas and P. Spirakis, "The Price of Selfish Routing," Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 510-519, July 2001.
20. C. McDiarmid, "Concentration," Chapter 9 in Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habib, C. McDiarmidt, J. Ramires-Alfonsin and B. Reed eds., Springer, 1998.
21. 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.
22. J. F. Nash, "Equilibrium Points in N-Person Games," Proceedings of the National Academy of Sciences, Vol. 36, pp. 48-49, 1950.
23. J. F. Nash, "Non-cooperative Games," Annals of Mathematics, Vol. 54, No. 2, pp. 286-295, 1951.
24. M. J. Osborne and A. Rubinstein, A Course in Game Theory, The MIT Press, 1994.
25. C. H. Papadimitriou, "Algorithms, Games and the Internet," Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 749-753, July 2001.
26. T. E. S. Raghavan, "Completely Mixed Strategies in Bimatrix Games," Journal of London Mathematical Society, Vol. 2, No. 2, pp. 709-712, 1970.
27. S. M. Ross, Stochastic Processes, Second Edition, John Wiley & Sons, Inc., 1996.
28. P. Schuurman and T. Vredeveld, "Performance Guarantees of Load Search for Multiprocessor Scheduling," Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pp. 370-382, June 2001.
29. M. Shaked and J. G. Shanthikumar, Stochastic Orders and Their Applications, Academic Press, San Diego, CA, 1994.
30. A. Vetta, "Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions," Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, October 2002, pp. 416-425.