An optimization approach for approximate nash equilibria

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

Volumn 4858 LNCS, Issue , 2007, Pages 42-56

  Tsaknakis, Haralampos ^a   Spirakis, Paul G ^b  

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

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; OPTIMIZATION;

NASH EQUILIBRIA; POLYNOMIAL TIME;

GAME THEORY;

EID: 38449115856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77105-0_8     Document Type: Conference Paper

References (11)

1. Boss, H., Byrka, J., Markakis, E.: New Algorithms for Approximate Nash Equilibria in Bimatrix Games. In: this volume of WINE (2007)
2. Chen, X., Deng, X.: Settling the complexity of 2-player Nash equilibrium. In: Proc. of the 47th IEEE Symp. on Foundations of Comp. Sci (FOCS 2006), pp. 261-272. IEEE Computer Society Press, Los Alamitos (2006)
3. Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress in approximate Nash Equilibria. In: Proc. of the 8th ACM Conf. on Electronic Commerce (EC 2007), ACM Press, New York (2007)
4. Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 297-306. Springer, Heidelberg (2006)
5. Kontogiannis, S., Panagopoulou, P., Spirakis, P.G.: Polynomial algorithms for approximating Nash equilibria in bimatrix games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 282-296. Springer, Heidelberg (2006)
6. Chen, X., Deng, X., Teng, S.: Computing Nash Equilibria: Approximation and smoothed complexity. In: Proc. of the 47th IEEE Symp. on Foundations of Comp. Sci (FOCS 2006), pp. 603-612. IEEE Press, New York (2006)
7. Kontogiannis, S., Spirakis, P.G.: Efficient algorithms for constant well supported approximate equilibria of bimatrix games. In: ICALP 2007 (2007)
8. Bellare, M., Rogaway, P.: The complexity of approximating a nonlinear program. Mathematical Programming 69, 429-441 (1995)
9. Sandholm, T., Gilpin, A., Conitzer, V.: Mixed-integer Programming Methods for Finding Nash Equilibria. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 495-501 (2005)
10. Tsaknakis, H., Spirakis, P.G.: An Optimization Approach for Approximate Nash Equilibria. In: the Electronic Colloqium on Computational Complexity (ECCC), as a Technical Report with number TR07067
11. Ye, Y.: A fully polynomial time approximation algorithm for computing a stationary point of the general linear complementarity problem. Mathematics of Operations Research 18(2), 334-345 (1993)