Games of fixed rank: A hierarchy of bimatrix games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1124-1132

  Kannan, Ravi ^a   Theobald, Thorsten ^b  

^a YALE UNIVERSITY   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; GAME THEORY; OPTIMIZATION; POLYNOMIALS; QUADRATIC PROGRAMMING; TELECOMMUNICATION NETWORKS;

CONNECTED COMPONENT; NASH EQUILIBRIA; NEW APPLICATIONS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; QUADRATIC OPTIMIZATION PROBLEMS; RANDOM SAMPLING METHOD;

POLYNOMIAL APPROXIMATION;

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

References (26)

1. I. Barany, S. Vempala, and A. Vetta. Nash equilibria in random games. In Proc. 46th IEEE Foundations of Computer Science (Pittsburgh, PA), 2005.
2. J. Bulow and J. Levin. Matching and price competition. To appear in American Economic Review.
3. X. Chen and X. Deng. Settling the complexity of 2-player Nash equilibrium. Electronic Colloquium on Computational Complexity. Report TR05-140, 2005.
4. X. Chen and X. Deng. Computing Nash equilibria: Approximation and smoothed complexity. Electronic Colloquium on Computational Complexity. Report TR06-23, 2006.
5. V. Conitzer and T. Sandholm. A technique for reducing normal-form games to compute a Nash equilibrium. Proc. Autonomous Agents and Multi Agent Sytems (AAMAS), Hakodate, Japan, 2006.
6. G.B. Dantzig. Linear Programming and Extensions. Princeton Univ. Press, Princeton, NJ, 1963.
7. C. Daskalakis, P.W. Goldberg, and C.H. Papadimitriou. The complexity of computing a Nash equilibrium. Proc. 38th ACM Symp. Theory of Computing. (Seattle, WA), 2006.
8. K. Isaacson and C.B. Millham. On a class of Nashsolvable bimatrix games and some related Nash subsets. Naval. Res. Logist. Quarterly 23:311-319, 1980.
9. 5) volume algorithm for convex bodies. Random Structures and Algorithms 11:1-50, 1997.
10. H. Keiding. On the maximal number of Nash equilibria in an n × n bimatrix game. Games Econom. Behavior 21:148-160, 1997.
11. S.C. Kontogiannis, P.N. Panagopoulou, P.G. Spirakis. Polynomial algorithms for approximating Nash equilibria of bimatrix games. Electronic Colloquium on Computational Complexity. Report TR06-81, 2006.
12. C.E. Lemke and J.T. Howson. Equilibrium points of bimatrix games. J. Soc. Indust. Appl. Math. 12:413-423, 1964.
13. R.J. Lipton, E. Markakis, and A. Mehta. Playing large games using simple strategies. In Proc. ACM Conf. on Electronic Commerce (San Diego, CA), 36-41, 2003.
14. O.L. Mangasarian. Equilibrium points of bimatrix games. J. Soc. Industr. Appl. Math. 12:778-780, 1964.
15. A. McLennan and I.-U. Park. Generic 4 × 4 two person games have at most 15 Nash equilibria. Games Econom. Behavior 26:111-130, 1997.
16. J. Nash. Equilibrium points in n-person games. Proc. Amer. Math. Soc. 36:48-49, 1950.
17. J. Nash. Non-cooperative games. Annals of Mathematics 54:286-295, 1951.
18. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ, 1944.
19. C.H. Papadimitriou. Algorithms, games and the Internet. In Proc. 33rd ACM Symp. Theory of Computing, Chersonissos, Kreta, 749-753, 2001.
20. C.H. Papadimitriou and T. Roughgarden. Computing equilibria in multi-player games. In Symp. on Discrete Algorithms (Vancouver, BC), 82-91, 2005.
21. T. Quint and M. Shubik. A bound on the number of Nash equilibria in a coordination game. Economic Letters 77:323-327, 2002.
22. R. Savani and B. von Stengel. Exponentially many steps for finding a Nash equilibrium in a bimatrix game. In Proc. 45th IEEE Foundations of Computer Science (Rome), 258-257, 2004.
23. B. von Stengel. New maximal numbers of equilibria in bimatrix games. Discrete Comput. Geom. 21:557-568, 1999.
24. B. von Stengel. Computing equilibria for two-person games. In R.J. Aumann, S. Hart (eds.), Handbook of Game Theory, North-Holland, Amsterdam, 2002.
25. S. Vavasis. Approximation algorithms for indefinite quadratic programming. Technical Report 91-1228, Dept. of Computer Science, Cornell University (Ithaca, NY), 1991.
26. S. Vavasis. Approximation algorithms for indefinite quadratic programming. Math. Program. 57:279-311, 1992.