How hard is it to approximate the best Nash equilibrium?

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 720-727

  Hazan, Elad ^a   Krauthgamer, Robert ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; GRAPH THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

ALGORITHMIC GAME THEORY; ALGORITHMIC TECHNIQUES; APPROXIMATE EQUILIBRIUMS; OPTIMIZATION PROBLEMS; PLANTED CLIQUES; POLYNOMIAL-TIME ALGORITHMS; QUASI-POLYNOMIAL TIME; TWO-PLAYER GAMES;

GAME THEORY;

EID: 70349144464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.79     Document Type: Conference Paper

References (31)

1. +07] N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, and N. Xie. Testing k-wise and almost k-wise independence. In 39th Annual ACM Symposium on Theory of Computing, pages 496-505, New York, NY, USA, 2007. ACM.
2. [AKS98] N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. Random Structures Algorithms, 13(3-4):457-466, 1998. (Pubitemid 128162654)
3. [BBM07] H. Bosse, J. Byrka, and E. Markakis. New algorithms for approximate nash equilibria in bimatrix games. In WINE 2007, volume 4858 of Lecture Notes in Computer Science, pages 17-29. Springer, 2007.
4. [CDT06] X. Chen, X. Deng, and S.-H. Teng. Computing nash equilibria: Approximation and smoothed complexity. In 47th Annual IEEE Symposium on Foundations of Computer Science, pages 603-612, Washington, DC, USA, 2006. IEEE Computer Society.
5. [CS03] V. Conitzer and T. Sandholm. Complexity results about nash equilibria. In 18th International Joint Conference on Artificial Intelligence, pages 765-771, 2003.
6. [DGP06] C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou. The complexity of computing a nash equilibrium. In 38th Annual ACM Symposium on Theory of computing, pages 71-78, New York, NY, USA, 2006. ACM.
7. [DMP06] C Daskalakis, A. Mehta, and C. H. Papadimitriou. A note on approximate nash equilibria. In WINE 2006, volume 4286 of Lecture Notes in Computer Science, pages 297-306. Springer, 2006.
8. [DMP07] C. Daskalakis, A. Mehta, and C. Papadimitriou. Progress in approximate nash equilibria. In 8th ACM conference on Electronic commerce, pages 355-358, New York, NY, USA, 2007. ACM.
9. [DP08] C. Daskalakis and C. H. Papadimitriou. Discretized multinomial distributions, covers, and nash equilibria in anonymous games. To appear in FOCS, 2008.
10. [EGG07] E. Elkind, L. A. Golberg, and P. W. Goldberg. Computing good nash equilibria in graphical games. In 8th ACM conference on Electronic commerce, pages 162-171, New York, NY, USA, 2007. ACM.
11. [Fei02] U. Feige. Relations between average case complexity and approximation complexity. In 34th annual ACM Symposium on Theory of Computing, pages 534-543. ACM, 2002.
12. [FK00] U. Feige and R. Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Structures Algorithms, 16(2):195-208, 2000.
13. [FK03] U. Feige and R. Krauthgamer. The probable value of the Lovász-Schrijver relaxations for maximum independent set. SIAM J. Comput, 32(2):345-370, 2003.
14. [FNS07] T. Feder, H. Nazerzadeh, and A. Saberi. Approximating nash equilibria using small-support strategies. In 8th ACM conference on Electronic commerce, pages 352-354, New York, NY, USA, 2007. ACM.
15. [GZ89] I. Gilboa and E. Zemel. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior, 1:80-93, 1989.
16. [HH05] E. Halperin and E. Hazan. HAPLOFREQ - estimating haplotype frequencies efficiently. In 9th RECOMB, volume 3500 of Lecture Notes in Computer Science, pages 553-568. Springer, 2005.
17. [Hoe63] W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
18. [Jer92] M. Jerrum. Large cliques elude the Metropolis process. Random Structures Algorithms, 3(4):347-359, 1992.
19. [JP00] A. Juels and M. Peinado. Hiding cliques for cryptographic security. Des. Codes Cryptogr., 20(3):269-280, 2000.
20. [KLS01] M. J. Kearns, M. L. Littman, and S. P. Singh. Graphical models for game theory. In 17th Conference in Uncertainty in Artificial Intelligence, pages 253-260. Morgan Kaufmann Publishers Inc., 2001.
21. [KPS06] S. C Kontogiannis, P. N. Panagopoulou, and P. G. Spirakis. Polynomial algorithms for approximating nash equilibria of bimatrix games. In WINE 2006, volume 4286 of Lecture Notes in Computer Science, pages 286-296. Springer, 2006.
22. [Kuč95] L. Kučera. Expected complexity of graph partitioning problems. Discrete Appl. Math., 57(2-3):193-212, 1995.
23. [KV02] M. Krivelevich and V. H. Vu. Approximating the independence number and the chromatic number in expected polynomial time. J. Comb. Optim., 6(2):143-155, 2002.
24. [LMM03] R. J. Lipton, E. Markakis, and A. Mehta. Playing large games using simple strategies. In 4th ACM conference on Electronic commerce, pages 36-41, New York, NY, USA, 2003. ACM.
25. [McS01] F. McSherry. Spectral partitioning of random graphs. In 42nd IEEE symposium on Foundations of Computer Science, page 529, Washington, DC, USA, 2001. IEEE Computer Society.
26. [Pap07] C. H. Papadimitriou. The complexity of finding nash equilibria. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 2, pages 29-51. Cambridge University Press, 2007.
27. [Pap08] C. H. Papadimitriou. The search for equilibrium concepts. In SAGT, volume 4997 of Lecture Notes in Computer Science, pages 1-3. Springer, 2008.
28. [PY96] C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the v-c dimension. J. Comput. Syst. Sci., 53(2):161-170, 1996.
29. [Rou08] T. Roughgarden. An algorithmic game theory primer. To appear in TCS, invited survey, 2008.
30. [Spi08] P. G. Spirakis. Approximate equilibria for strategic two person games. In SAGT 2008, volume 4997 of Lecture Notes in Computer Science, pages 5-21. Springer, 2008.
31. [TS07] H. Tsaknakis and P. G. Spirakis. An optimization approach for approximate nash equilibria. In WINE 2007, volume 4858 of Lecture Notes in Computer Science, pages 42-56. Springer, 2007.