Approximate equilibria for strategic two person games

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

Volumn 4997 LNCS, Issue , 2008, Pages 5-21

  Spirakis, Paul G ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BIMATRIX GAMES; NASH EQUILIBRIA; POLYNOMIAL TIME CONSTRUCTION; TWO PERSON GAMES;

GAME THEORY;

EID: 44449143936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79309-0_3     Document Type: Conference Paper

References (26)

1. Abbott, T., Kane, D., Valiant, P.: On the complexity of two-player win-lose games. In: Proc. of 46th IEEE Symp. on Found. of Comp. Sci. (FOCS 2005), pp. 113-122 (2005)
2. Althöfer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and Applications 199, 339-355 (1994)
3. Bosse, H., Byrka, J., Markakis, E.: New Algorithms for Approximate Nash Equilibria in Bimatrix Games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, Springer, Heidelberg (2007)
4. Bárány, I., Vempala, S., Vetta, A.: Nash equilibria in random games. In: Proc. of 46th IEEE Symp. on Found. of Comp. Sci. (FOCS 2005), pp. 123-131. IEEE Computer Society Press, Los Alamitos (2005)
5. Chen, X., Deng, X.: Settling the complexity of 2-player nash equilibrium. In: Proc. of 47th IEEE Symp on Found of Comp. Sci. (FOCS 2006), pp. 261-272. IEEE Computer Society Press, Los Alamitos (2006)
6. Chen, X., Deng, X., Teng, S.: Computing nash equilibria: Approximation and smoothed complexity. In: Proc. of 47th IEEE Symp on Found of Comp Sci (FOCS 2006), pp. 603-612. IEEE Computer Society Press, Los Alamitos (2006)
7. Chen, X., Deng, X., Teng, S.: Sparse Games Are Hard. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 262-273. Springer, Heidelberg (2006)
8. Conitzer, V., Sandholm, T.: Complexity results about nash equilibria. In: In Proc. of 18th Int Joint Conf on Art. Intel (IJCAI 2003), pp. 765-771. Morgan Kaufmann, San Francisco (2003)
9. Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a nash equilibrium. In: Proc. of 38th ACM Symp on Th of Comp (STOC 2006), pp. 71-78 (2006)
10. 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)
11. Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress in approximate nash equilibrium. In: Proc. of 8th ACM Conf. on El. Comm. (EC 2007), pp. 355-358 (2007)
12. Daskalakis, C., Papadimitriou, C.: Three player games are hard. Technical Report TR05-139, Electr. Coll. on Comp. Compl. (ECCC) (2005)
13. Gilboa, I., Zemel, E.: Nash and correlated equilibria: Some complexity considerations. Games & amp; Econ. Behavior 1, 80-93 (1989)
14. Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: Proc. of 38th ACM Symp. on Th. of Comp. (STOC 2006), pp. 61-70 (2006)
15. Kontogiannis, S.C., Panagopoulou, P., Spirakis, P.G.: Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. In: Spirakis, P.-G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 286-296. Springer, Heidelberg (2006)
16. Spirakis, P.G., Kontogiannis, S.C.: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 595-606. Springer, Heidelberg (2007)
17. Kontogiannis, S.C., Spirakis, P.G.: Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 596-608. Springer, Heidelberg (2007)
18. Lemke, C., Howson, J.T.: Equilibrium points of bimatrix games. Journal of the Society for Industrial and Applied Mathematics 12:413423, DELIS-TR-0487 (1964)
19. Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proc. of 4th ACM Conf. on El. Comm. (EC 2003), pp. 36-41 (2003)
20. Nash, J.: Noncooperative games. Annals of Mathematics 54, 289-295 (1951)
21. Papadimitriou, C.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comp. Sys. Sci. 48, 498-532 (1994)
22. Papadimitriou, C.: Algorithms, games and the internet. In: Proc. of 33rd ACM Symp. on Th. of Comp. (STOC 2001), pp. 749-753 (2001)
23. Sandholm, T., Gilpin, A., Conitzer, V.: Mixed-integer programming methods for finding Nash equilibria. In: Proc. of the 20th Nat. Conf. on Art. Intel (AAAI 2005), pp. 495-501 (2005)
24. Savani, R., von Stengel, B.: Hard-to-solve bimatrix games. Econometrica 74(2), 397-429 (2006)
25. Tsaknakis, H., Spirakis, P.: An optimization approach for approximate Nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, Springer, Heidelberg (2007)
26. Ye, Y.: A fully polynomial time approximation algorithm for computing a stationary point of the general linear complementarity problem. Mathematics of Operations Research 18, 334-345 (1993)