Well supported approximate equilibria in bimatrix games

Algorithmica (New York)

Volumn 57, Issue 4, 2010, Pages 653-667

  Kontogiannis, Spyros C ^a,b   Spirakis, Paul G ^b  

^a UNIVERSITY OF IOANNINA   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Bimatrix games; Well supported approximate Nash equilibria

Indexed keywords

APPROXIMABILITY; BEST RESPONSE; BIMATRIX GAMES; NASH EQUILIBRIA; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; POSITIVE PROBABILITY; SUBEXPONENTIAL TIME; ZERO SUMS;

APPROXIMATION ALGORITHMS; LINEARIZATION; POLYNOMIAL APPROXIMATION;

GAME THEORY;

EID: 77952098917     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9227-6     Document Type: Article

References (29)

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 '05), pp. 113-122 (2005) (Pubitemid 44375724)
2. L. Addario-Berry N. Olver A. Vetta 2007 A polynomial time algorithm for finding Nash equilibria in planar win-lose games J. Graph Algorithms Appl. 11 1 309 319 1152.91382 2354174
3. I. Althöfer 1994 On sparse approximations to randomized strategies and convex combinations Linear Algebra Appl. 199 339 355 0801.90074 10.1016/0024-3795(94)90357-3 1274423 (Pubitemid 24774840)
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 '05), pp. 123-131. IEEE Comput. Soc. Los Alamitos (2005) (Pubitemid 44375725)
5. I. Bomze E. de Klerk 2002 Solving standard quadratic optimization problems via linear, semidefinite and copositive programming J. Global Optim. 24 163 185 1047.90038 10.1023/A:1020209017701 1934026 (Pubitemid 35168547)
6. Bosse, H.Byrka, J.Markakis, E.: New algorithms for approximate Nash equilibria in bimatrix games. In: Proc. of 3rd W. on Internet and Net. Econ. (WINE '07). LNCS, vol. 4858, pp. 17-29. Springer, Berlin (2007)
7. Chen, X.Deng, X.: Settling the complexity of 2-player Nash equilibrium. In: Proc. of 47th IEEE Symp. on Found. of Comp. Sci. (FOCS '06), pp. 261-272. IEEE Comput. Soc. Los Alamitos (2006) (Pubitemid 351175515)
8. Chen, X.Deng, X.Teng, S.H.: Computing Nash equilibria: Approximation and smoothed complexity. In: Proc. of 47th IEEE Symp. on Found. of Comp. Sci. (FOCS '06), pp. 603-612. IEEE Comput. Soc. Los Alamitos (2006) (Pubitemid 351175548)
9. Chen, X.Deng, X.Teng, S.H.: Sparse games are hard. In: Proc. of 2nd W. on Internet and Net. Econ. (WINE '06). LNCS, vol. 4286, pp. 262-273. Springer, Berlin (2006)
10. Conitzer, V.Sandholm, T.: Complexity results about Nash equilibria. In: Proc. of 18th Int. Joint Conf. on Art. Intel. (IJCAI '03), pp. 765-771. Morgan Kaufmann, San Mateo (2003)
11. Daskalakis, C.Papadimitriou, C.: Three player games are hard. Technical Report TR05-139, Electr. Coll. on Comp. Compl. (ECCC) (2005)
12. Daskalakis, C.Goldberg, P.Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Proc. of 38th ACM Symp. on Th. of Comp. (STOC '06), pp. 71-78. Assoc. Comput. Mach. New York (2006) (Pubitemid 44306539)
13. Daskalakis, C.Mehta, A.Papadimitriou, C.: A note on approximate equilibria. In: Proc. of 2nd W. on Internet and Net. Econ. (WINE '06). LNCS, vol. 4286, pp. 297-306. Springer, Berlin (2006)
14. Daskalakis, C.Mehta, A.Papadimitriou, C.: Progress in approximate Nash equilibrium. In Proc. of 8th ACM Conf. on El. Comm. (EC '07), pp. 355-358 (2007)
15. Feder, T.Nazerzadeh, H.Saberi, A.: Approximating Nash equilibria using small-support strategies. In Proc. of 8th ACM Conf. on El. Comm. (EC '07), pp. 352-354 (2007) (Pubitemid 350164731)
16. I. Gilboa E. Zemel 1989 Nash and correlated equilibria: Some complexity considerations Games Econ. Behav. 1 80 93 0755.90093 10.1016/0899-8256(89)90006- 7 1000049
17. Goldberg, P.Papadimitriou, C.: Reducibility among equilibrium problems. In: Proc. of 38th ACM Symp. on Th. of Comp. (STOC '06), pp. 61-70. Assoc. Comput. Mach. New York (2006) (Pubitemid 44306538)
18. Kannan, R.Theobald, T.: Games of fixed rank: A hierarchy of bimatrix games. In Proc. of 18th ACM-SIAM Symp. on Discr. Alg. (SODA '07) (2007)
19. Kontogiannis, S.Spirakis, P.: Well supported approximate equilibria in bimatrix games: A graph theoretic approach. In: Proc. of 32nd Int. Symp. on Math. Found. of Comp. Sci. (MFCS '07). LNCS, vol. 4708, pp. 596-608. Springer, Berlin (2007)
20. Kontogiannis, S.Spirakis, P.: Efficient algorithms for constant well supported approximate equilibria in bimatrix games. In: Proc. of 34th Int. Col. on Aut. Lang. and Progr. (ICALP '07). LNCS, vol. 4596, pp. 595-606. Springer, Berlin (2007)
21. Kontogiannis, S.Panagopoulou, P.Spirakis, P.: Polynomial algorithms for approximating Nash equilibria in bimatrix games. In: Proc. of 2nd W. on Internet and Net. Econ. (WINE '06). LNCS, vol. 4286, pp. 286-296. Springer, Berlin (2006)
22. C.E. Lemke J.T. Howson Jr. 1964 Equilibrium points of bimatrix games J. Soc. Ind. Appl. Math. 12 413 423 0128.14804 10.1137/0112033 173556
23. Lipton, R.Markakis, E.Mehta, A.: Playing large games using simple strategies. In: Proc. of 4th ACM Conf. on El. Comm. (EC '03), pp. 36-41. Assoc. Comput. Mach. New York (2003)
24. J. Nash 1951 Noncooperative games Ann. Math. 54 289 295 10.2307/1969529 43432
25. Nesterov, Y.: Random walk in a simplex and quadratic optimization over convex polytopes. Technical report, DOCUMENT DE TRAVAIL 2003/71, EUEN/CORE-Center for operations research and econometrics, CORE (2003)
26. C. Papadimitriou 1994 On the complexity of the parity argument and other inefficient proofs of existence J. Comput. Syst. Sci. 48 498 532 0806.68048 10.1016/S0022-0000(05)80063-7 1279412 (Pubitemid 124013301)
27. Papadimitriou, C.: Algorithms, games and the Internet. In Proc. of 33rd ACM Symp. on Th. of Comp. (STOC '01), pp. 749-753 (2001)
28. R. Savani B. von Stengel 2006 Hard-to-solve bimatrix games Econometrica 74 2 397 429 1145.91301 10.1111/j.1468-0262.2006.00667.x 2207396 (Pubitemid 43417673)
29. Tsaknakis, H.Spirakis, P.: An optimization approach for approximate Nash equilibria. In: Proc. of 3rd W. on Internet and Net. Econ. (WINE '07). LNCS, vol. 4858, pp. 42-56. Springer, Berlin (2007)