An optimization approach for approximate Nash equilibria

Internet Mathematics

Volumn 5, Issue 4, 2008, Pages 365-382

  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

EID: 78650915551     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2008.10129172     Document Type: Article

References (12)

1. M. Bellare and P. Rogaway. “The Complexity of Approximating a Nonlinear Program.” Mathematical Programming 69 (1995), 429–441.
2. H. Boss, J. Byrka, and E. Markakis. “New Algorithms for Approximate Nash Equilibria in Bimatrix Games.” Paper presented at the Third International Workshop on Internet and Network Economics (WINE 2007), San Diego, CA, December 12–14, 2007.
3. X. Chen and X. Deng. “Settling the Complexity of 2-Player Nash Equilibrium.” In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 261–272. Los Alamitos, CA: IEEE Press, 2006.
4. X. Chen, X. Deng, and S. Teng. “Computing Nash Equilibria: Approximation and Smoothed Complexity.” In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 603–612. Los Alamitos, CA: IEEE Press, 2006.
5. C. Daskalakis, A. Mehta, and C. Papadimitriou. “A Note on Approximate Nash Equilibria.” In Internet and Network Economics Second International Workshop, WINE 2006, Patras, Greece, December 15–17, 2006, Proceedings, Lecture Notes in Computer Science 4286, pp. 297–306. New York: Springer, 2006.
6. C. Daskalakis, A. Mehta, and C. Papadimitriou. “Progress in Approximate Nash Equilibria.” In Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 355–358. New York: ACM Press, 2007.
7. S. Kontogiannis, P. Panagopoulou, and P. G. Spirakis. “Polynomial Algorithms for Approximating Nash Equilibria in Bimatrix Games.” In emphInternet and Network Economics Second International Workshop, WINE 2006, Patras, Greece, December 15–17, 2006, Proceedings, Lecture Notes in Computer Science 4286, pp. 282–296. New York: Springer, 2006.
8. S. Kontogiannis and P. G. Spirakis. “Efficient Algorithms for Constant Well Supported Approximate Equilibria of Bimatrix Games.” In Automata, Languages and Programming: 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9–13, 2007, Proceedings, Lecture Notes in Computer Science 4596, pp. 595–606. Berlin: Springer, 2007.
9. T. Sandholm, A. Gilpin, and V. Conitzer. “Mixed-Integer Programming Methods for Finding Nash Equilibria.” In Proceedings of the 20th National Conference on Artificial Intelligence, Vol. 2, pp. 495–501. Menlo Park, CA: AAAI Press, 2005.
10. H. Tsaknakis and P.G. Spirakis. “An Optimization Approach for Approximate Nash Equilibria.” Technical report number TR07-067, Electronic Colloqium on Computational Complexity, August 23, 2007.
11. H. Tsaknakis, P. G. Spirakis, and D. Kanoulas. “Performance Evaluation of a Descent Algorithm for Bi-matrix Games.” In Internet and Network Economics: 4th International Workshop, WINE 2008, Shanghai, China, December 17–20, 2008, Proceedings, edited by C. Papadimitriou and S. Zhang, Lecture Notes in Computer Science 5385, pp. 222–230. Berlin: Springer, 2008.
12. Yinyu Ye. “A Fully Polynomial Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem.” Mathematics of Operations Research 18:2 (1993), 334–345.