New algorithms for approximate nash equilibria in bimatrix games

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

Volumn 4858 LNCS, Issue , 2007, Pages 17-29

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

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATE NASH EQUILIBRIA; APPROXIMATION GUARANTEE; BIMATRIX GAMES;

GAME THEORY;

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

References (13)

1. Althöfer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and Applications 199, 339-355 (1994)
2. Chen, X., Deng, X.: Settling the complexity of 2-player Nash equilibrium. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 261-272. IEEE Computer Society Press, Los Alamitos (2006)
3. Chen, X., Deng, X., Teng, S.: Computing Nash equilibria: Approximation and smoothed complexity. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 603-612. IEEE Computer Society Press, Los Alamitos (2006)
4. Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Annual ACM Symposium on Theory of Computing, pp. 71-78. ACM Press, New York (2006)
5. Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Workshop on Internet and Network Economics, pp. 297-306 (2006)
6. Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress on approximate Nash equilibria. In: ACM Conference on Electronic Commerce, ACM Press, New York (2007)
7. Feder, T., Nazerzadeh, H., Saberi, A.: Approximating Nash equilibria with small-support strategies. In: ACM Conference on Electronic Commerce, ACM Press, New York (2007)
8. Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: Annual ACM Symposium on Theory of Computing, pp. 61-70. ACM Press, New York (2006)
9. Kontogiannis, S., Panagopoulou, P., Spirakis, P.: Polynomial algorithms for approximating Nash equilibria of bimatrix games. In: Workshop on Internet and Network Economics (2006)
10. Kontogiannis, S., Spirakis, P.: Efficient algorithms for constant well supported approximate equilibria in bimatrix games. In: 34th International Colloquium on Automata, Languages and Programming (2007)
11. Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: 4th ACM Conference on Electronic Commerce, pp. 36-41. ACM Press, New York (2003)
12. Nash, J.F.: Non-cooperative games. Annals of Mathematics 54, 286-295 (1951)
13. Spirakis, P., Tsaknakis, H.: An optimization approach for approximate Nash equilibria. In: Workshop on Internet and Network Economics (2007)