Exponentially many steps for finding a nash equilibrium in a bimatrix game

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 258-267

  Savani, Rahul ^a   Von Stengel, Bernhard ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GAME THEORY; INTERNET; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

GOLDEN RATIO; LEMKE-HOWSON ALGORITHM; NASH EQUILIBRIUM; POLYTOPES;

COMPUTATIONAL COMPLEXITY;

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

References (41)

1. Audet, C., P. Hansen, B. Jaumard, and G. Savard (2001), Enumeration of all extreme equilibria of bimatrix games. SIAM Journal on Scientific Computing 23, 323-338.
2. Borodin, A., and R. El-Yaniv (1998), Online Computation and Competitive Analysis. Cambridge Univ. Press, Cambridge.
3. Conitzer, V., and Sandholm, T. (2003), Complexity results about Nash equilibria. In: Proc. 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 765-771.
4. Cottle, R. W., J.-S. Pang, and R. E. Stone (1992), The Linear Complementarity Problem. Acad. Press, San Diego.
5. Dantzig, G. B. (1963), Linear Programming and Extensions. Princeton University Press, Princeton.
6. Gale, D. (1963), Neighborly and cyclic polytopes. In: Convexity, Proc. Symposia in Pure Math., Vol. 7, ed. V. Klee, American Math. Soc., Providence, Rhode Island, 225-232.
7. Garcia, C. B., and W. I. Zangwill (1981), Pathways to Solutions, Fixed Points, and Equilibria. Prentice-Hall, Englewood Cliffs.
8. Gilboa, I., and E. Zemel (1989), Nash and correlated equilibria: some complexity considerations. Games and Economic Behavior 1, 80-93.
9. Grünbaum, B. (2003), Convex polytopes, 2nd ed. Springer, New York.
10. Fathi, Y. (1979), Computational complexity of LCPs associated with positive definite symmetric matrices. Mathematical Programming 17, 335-344.
11. Jansen, M. J. M. (1981), Maximal Nash subsets for bimatrix games. Naval Res. Logistics Quarterly 28, 147-152.
12. Kalai, G., and D. J. Kleitman (1992), A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Amer. Math. Soc. 26, 315-316.
13. Klee, V., and P. Kleinschmidt (1987), The d-step conjecture and its relatives. Math. of Oper. Res. 12, 718-755.
14. Klee, V., and G. J. Minty (1972), How good is the simplex algorithm? In: Inequalities, III, Proc. Third Sympos., UCLA, 1969, ed. O. Shisha, Academic Press, New York, 159-175.
15. Lemke, C. E., and J. T. Howson, Jr. (1964), Equilibrium points of bimatrix games. Journal of the Society for Industrial and Applied Mathematics 12, 413-423.
16. Lemke, C. E. (1965), Bimatrix equilibrium points and mathematical programming. Manag. Science 11, 681-689.
17. Lipton, R. J., E. Markakis, and A. Mehta (2003), Playing large games using simple strategies. Proc. 4th ACM conf. Electronic Commerce, San Diego, 36-41.
18. McKelvey, R. D., and A. McLennan (1996), Computation of equilibria in finite games. In: Handbook of Computational Economics, Vol. I, eds. H. M. Amman, D. A. Kendrick, and J. Rust, Elsevier, Amsterdam, 87-142.
19. Megiddo, N. (1986), On the expected number of linear complementarity cones intersected by random and semi-random rays. Mathematical Programming 35, 225-235.
20. Megiddo, N., and C. H. Papadimitriou (1991), On total functions, existence theorems and computational complexity (Note). Theoretical Computer Science 81, 317-324.
21. Morris, W. D., Jr. (1994), Lemke paths on simple polytopes. Math. of Oper. Res. 19, 780-789.
22. Murty, K. G. (1978), Computational complexity of complementary pivot methods. Mathematical Programming Study 7: Complementary and fixed point problems, 61-73.
23. Nash, J. F. (1951), Non-cooperative games. Annals of Mathematics 54, 286-295.
24. Nisan, N., and A. Ronen (2001), Algorithmic mechanism design. Games and Economic Behavior 35, 166-196. [Extended Abstract in Proc. 31st STOC (1999), 129-140.]
25. Nisan, N., and A. Ronen (2001), Algorithmic mechanism design. Games and Economic Behavior 35, 166-196. [Extended Abstract in Proc. 31st STOC (1999), 129-140.]
26. Papadimitriou, C. H. (1994), On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48, 498-532.
27. Papadimitriou, C. H. (1994), Computational Complexity. Addison-Wesley, Reading, Mass.
28. Papadimitriou, C. H. (2001), Algorithms, games, and the internet. In: Proc. 33rd STOC, 749-753.
29. Rosenmüller, J. (1971), On a generalization of the Lemke-Howson algorithm to noncooperative N-person games. SIAM J. Appl. Math. 21, 73-79.
30. Roughgarden, T. (2002), Selfish Routing. PhD thesis, Cornell University.
31. Savani, R. (2004), Challenge instances for NASH. Research Report LSE-CDAM-2004-14, London School of Economics.
32. Savani, R., and B. von Stengel (2004), Exponentially many steps for finding a Nash equilibrium in a bimatrix game. Research Report LSE-CDAM-2004-03, London School of Economics.
33. Shapley, L. S. (1974), A note on the Lemke-Howson algorithm. Mathematical Programming Study 1: Pivoting and Extensions, 175-189.
34. von Stengel, B. (1999), New maximal numbers of equilibria in bimatrix games. Discrete and Computational Geometry 21, 557-568.
35. von Stengel, B. (2002), Computing equilibria for two-person games. Chapter 45, Handbook of Game Theory, Vol. 3, eds. R. J. Aumann and S. Hart, North-Holland, Amsterdam, 1723-1759.
36. von Stengel, B., A. H. van den Elzen, and A. J. J. Talman (2002), Computing normal form perfect equilibria for extensive two-person games. Econometrica 70, 693-715.
37. Vorob'ev, N. N. (1958), Equilibrium points in bimatrix games. Theory of Probability and its Appl. 3, 297-309.
38. Wilson, R. (1971), Computing equilibria of N-person games. SIAM J. Appl. Math. 21, 80-87.
39. Winkels, H.-M. (1979), An algorithm to determine all equilibrium points of a bimatrix game. In: Game Theory and Mathematical Economics, eds. O. Moeschlin and D. Pallaschke, North-Holland, Amsterdam, 137-148.
40. Yao, A. C. (1977), Probabilistic computation: towards a unified measure of complexity. In: Proc. 18th FOCS, 222-227.
41. Ziegler, G. M. (1995), Lectures on Polytopes. Springer, New York.