Polynomial algorithms for approximating Nash equilibria of bimatrix games

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

Volumn 4286 LNCS, Issue , 2006, Pages 286-296

  Kontogiannis, Spyros C ^a,b   Panagopoulou, Panagiota N ^b   Spirakis, Paul G ^b  

^a UNIVERSITY OF IOANNINA   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

BIMATRIX GAMES; NASH EQUILIBRIA; NASH EQUILIBRIUM; PARAMETERIZED; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME; SIMPLE ALGORITHM; TIME POLYNOMIALS;

APPROXIMATION ALGORITHMS; INTERNET; POLYNOMIAL APPROXIMATION; WINE;

COMPUTATION THEORY;

EID: 70349123254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944874_26     Document Type: Conference Paper

References (12)

1. I. Althöfer. "On Sparse Approximations to Randomized Strategies and Convex Combinations". Linear Algebra and Applications, 199:339355, 1994.
2. Imre Barany, Santosh Vempala and Adrian Vetta: "Nash Equilibria in Random Games". In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp. 123-131, 2005.
3. Xi Chen and Xiaotie Deng: "Settling the Complexity of 2-Player Nash-Equilibrium". Electronic Colloquium on Computational Complexity (ECCC), TR05-140, 2005.
4. Xi Chen, Xiaotie Deng and Shang-Hua Teng: "Computing Nash Equilibria: "Approximation and Smoothed Complexity". Electronic Colloquium on Computational Complexity (ECCC), TR06-023, 2006.
5. Constantinos Daskalakis, P.W. Goldberg and Christos Papadimitriou: " The Complexity of Computing a Nash Equilibrium". Electronic Colloquium on Computational Complexity (ECCC), TR05-115, 2005.
6. Constantinos Daskalakis, Aranyak Mehta and Christos Papadimitriou: "A Note on Approximate Nash Equilibria". 2nd Workshop on Internet and Network Economics (WINE'06), 2006.
7. Constantinos Daskalakis and Christos Papadimitriou: "Three-player Games are Hard". Electronic Colloquium on Computational Complexity (ECCC), TR05-139, 2005.
8. C. E. Lemke: "Bimatrix Equilibrium Points and Mathematical Programming". Management Science, Vol. 11, pp. 681-689, 1965.
9. C. E. Lemke and J. T. Howson: "Equilibrium Points of Bimatrix Games". J. Soc. Indust. Appl. Math., Vol. 12, pp. 413-423, 1964.
10. Richard J. Lipton, Evangelos Markakis and Aranyak Mehta: "Playing Large Games using Simple Startegies". In EC '03: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 36-41, 2003.
11. J. Nash: "Noncooperative Games". Annals of Mathematics, Vol. 54, pp. 289-295, 1951.
12. C. H. Papadimitriou: "On Inefficient Proofs of Existence and Complexity Classes". In Proceedings of the 4th Czechoslovakian Symposium on Combinatorics, 1991.