New algorithms for approximate Nash equilibria in bimatrix games

Theoretical Computer Science

Volumn 411, Issue 1, 2010, Pages 164-173

  Bosse, Hartwig ^a   Byrka, Jaroslaw ^b   Markakis, Evangelos ^c  

^a GOETHE UNIVERSITY   (Germany)

^b EPFL   (Switzerland)

^c CWI   (Netherlands)

Author keywords

Approximate Nash equilibria; Noncooperative games

Indexed keywords

APPROXIMATION ERRORS; BIMATRIX GAMES; LINEAR PROGRAMS; MULTIPLAYER GAMES; NASH EQUILIBRIA; NON-COOPERATIVE; NONCOOPERATIVE GAME; POLYNOMIAL-TIME ALGORITHMS; SIMPLER ALGORITHMS; TWO-PLAYER GAMES; ZERO-SUM GAME;

GAME THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 71849086970     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.09.023     Document Type: Article

References (16)

1. Althöfer I. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and Applications 199 (1994) 339-355
2. H. Bosse, J. Byrka, E. Markakis, New algorithms for approximate Nash equilibria, in: 3rd Workshop on Internet and Network Economics, WINE, 2007, pp. 17-29
3. X. Chen, X. Deng, Settling the complexity of 2-player Nash equilibrium, in: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2006, pp. 261-272
4. X. Chen, X. Deng, S. Teng, Computing Nash equilibria: Approximation and smoothed complexity, in: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS,2006, pp. 603-612
5. C. Daskalakis, P. Goldberg, C. Papadimitriou, The complexity of computing a Nash equilibrium, in: 38th Annual ACM Symposium on Theory of Computing, STOC, 2006, pp. 71-78
6. C. Daskalakis, A. Mehta, C. Papadimitriou, A note on approximate Nash equilibria, in: 2nd Workshop on Internet and Network Economics, WINE, 2006, pp. 297-306
7. C. Daskalakis, A. Mehta, C. Papadimitriou, Progress on approximate Nash equilibria, in: 8th ACM Conference on Electronic Commerce, 2007, pp. 355-358
8. K. Etessami, M. Yannakakis, On the complexity of Nash equilibria and other fixed points, in: 48th Symposium on Foundations of Computer Science, FOCS, 2007, pp. 113-123
9. T. Feder, H. Nazerzadeh, A. Saberi, Approximating Nash equilibria with small-support strategies, in: 8th ACM Conference on Electronic Commerce, 2007, pp. 352-354
10. P. Goldberg, C. Papadimitriou, Reducibility among equilibrium problems, in: 38th Annual ACM Symposium on Theory of Computing, STOC, 2006, pp. 61-70
11. S. Kontogiannis, P. Panagopoulou, P. Spirakis, Polynomial algorithms for approximating Nash equilibria of bimatrix games, in: 2nd Workshop on Internet and Network Economics, WINE, 2006, pp. 286-296
12. S. Kontogiannis, P. Spirakis, Efficient algorithms for constant well supported approximate equilibria in bimatrix games, in: 34th International Colloquium on Automata, Languages and Programming, ICALP, 2007, pp. 595-606
13. R. Lipton, E. Markakis, A. Mehta, Playing large games using simple strategies, in: 4th ACM Conference on Electronic Commerce, 2003, pp. 36-41
14. Nash J.F. Non-cooperative games. Annals of Mathematics 54 (1951) 286-295
15. P. Spirakis, H. Tsaknakis, An optimization approach for approximate Nash equilibria, in: 3rd Workshop on Internet and Network Economics, WINE, 2007, pp. 42-56
16. P.G. Spirakis, Approximate equilibria for strategic two person games, in: 1st International Symposium on Algorithmic Game Theory, SAGT, 2008, pp. 5-21