How hard is it to approximate the best nash equilibrium?

SIAM Journal on Computing

Volumn 40, Issue 1, 2011, Pages 79-91

  Hazan, Elad ^a   Krauthgamer, Robert ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Game theory; Hidden clique; Logarithmically restricted NP; Nash equilibrium

Indexed keywords

ALGORITHMIC GAME THEORY; APPROXIMATE EQUILIBRIUMS; CLIQUE SIZE; COMBINATORICS; HIDDEN CLIQUE; LOGARITHMICALLY-RESTRICTED NP; NASH EQUILIBRIUM; NEW YORK; NP-HARD; NP-HARDNESS; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS; QUASI-POLYNOMIAL TIME; RANDOM GRAPHS; SOCIAL WELFARE; TWO-PLAYER GAMES;

ALGORITHMS; FORMAL LOGIC; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

GAME THEORY;

EID: 79952972547     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090766991     Document Type: Article

References (40)

1. N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, and N. Xie, Testing k-wise and almost k-wise independence, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, ACM, New York, 2007, pp. 496-505. (Pubitemid 47630769)
2. N. Alon, M. Krivelevich, and B. Sudakov, Finding a large hidden clique in a random graph, Random Structures Algorithms, 13 (1998), pp. 457-466.
3. H. Bosse, J. Byrka, and E. Markakis, New algorithms for approximate Nash equilibria in bimatrix games, in WINE 2007, Lecture Notes in Comput. Sci. 4858, Springer-Verlag, Berlin, 2007, pp. 17-29.
4. S. C. Brubaker and S. S. Vempala, Random tensors and planted cliques, in Proceedings of the 13th International Workshop on Randomization and Computation (RANDOM), Lecture Notes in Comput. Sci. 5687, Springer-Verlag, Berlin, 2009, pp. 406-419.
5. X. Chen, X. Deng, and S.-H. Teng, Settling the complexity of computing two-player Nash equilibria, J. ACM, 56 (2009), article 14.
6. V. Conitzer and T. Sandholm, Complexity results about Nash equilibria, in Proceedings of the 18th International Joint Conference on Artificial Intelligence, Morgan Kaufmann Publishers Inc., San Francisco, 2003, pp. 765-771.
7. C. Daskalakis, private communication, 2008.
8. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, The complexity of computing a Nash equilibrium, SIAM J. Comput., 39 (2009), pp. 195-259.
9. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, The complexity of computing a Nash equilibrium, Commun. ACM, 52 (2009), pp. 89-97.
10. C. Daskalakis, A. Mehta, and C. Papadimitriou, Progress in approximate Nash equilibria, in Proceedings of the 8th ACM Conference on Electronic Commerce, ACM, New York, 2007, pp. 355-358. (Pubitemid 350164732)
11. C. Daskalakis, A. Mehta, and C. H. Papadimitriou, A note on approximate Nash equilibria, in WINE 2006, Lecture Notes in Comput. Sci. 4286, Springer-Verlag, Berlin, 2006, pp. 297-306.
12. C. Daskalakis and C. H. Papadimitriou, Discretized multinomial distributions and Nash equilibria in anonymous games, in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2008, pp. 25-34.
13. E. Elkind, L. A. Golberg, and P. W. Goldberg, Computing good Nash equilibria in graphical games, in Proceedings of the 8th ACM Conference on Electronic Commerce, ACM, New York, 2007, pp. 162-171. (Pubitemid 350164710)
14. T. Feder, H. Nazerzadeh, and A. Saberi, Approximating Nash equilibria using small-support strategies, in Proceedings of the 8th ACM Conference on Electronic Commerce, ACM, New York, 2007, pp. 352-354. (Pubitemid 350164731)
15. U. Feige, Relations between average case complexity and approximation complexity, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, ACM, New York, 2002, pp. 534-543. (Pubitemid 35009414)
16. U. Feige, private communication, 2008.
17. U. Feige and J. Kilian, On limited versus polynomial nondeterminism, Chicago J. Theoret. Comput. Sci., 1997, article 1.
18. U. Feige and R. Krauthgamer, Finding and certifying a large hidden clique in a semirandom graph, Random Structures Algorithms, 16 (2000), pp. 195-208.
19. U. Feige and R. Krauthgamer, The probable value of the Lovász-Schrijver relaxations for maximum independent set, SIAM J. Comput., 32 (2003), pp. 345-370.
20. A. M. Frieze and R. Kannan, A new approach to the planted clique problem, in Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dagstuhl Seminar Proceedings 08004, Schloss Dagstuhl, Germany, 2008 pp. 187-198.
21. I. Gilboa and E. Zemel, Nash and correlated equilibria: Some complexity considerations, Games Econom. Behav., 1 (1989), pp. 80-93.
22. E. Halperin and E. Hazan, HAPLOFREQ-estimating haplotype frequencies efficiently, in Research in Computational Molecular Biology, Lecture Notes in Comput. Sci. 3500, Springer, Berlin, 2005, pp. 553-568.
23. E. Hazan and R. Krauthgamer, How hard is it to approximate the best Nash equilibrium?, in Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2009, pp. 720-727.
24. W. Hoeffding, Probability inequalities for sums of bounded random variables, J.Amer. Statist. Assoc., 58 (1963), pp. 13-30.
25. M. Jerrum, Large cliques elude the Metropolis process, Random Structures Algorithms, 3 (1992), pp. 347-359.
26. A. Juels and M. Peinado, Hiding cliques for cryptographic security, Des. Codes Cryptogr., 20 (2000), pp. 269-280.
27. M. J. Kearns, M. L. Littman, and S. P. Singh, Graphical models for game theory, in Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers, San Francisco, 2001, pp. 253-260.
28. S. C. Kontogiannis, P. N. Panagopoulou, and P. G. Spirakis, Polynomial algorithms for approximating Nash equilibria of bimatrix games, inWINE 2006, Lecture Notes in Comput. Sci. 4286, Springer-Verlag, Berlin, 2006, pp. 286-296.
29. M. Krivelevich and V. H. Vu, Approximating the independence number and the chromatic number in expected polynomial time, J. Comb. Optim., 6 (2002), pp. 143-155. (Pubitemid 34176300)
30. L. Kučera, Expected complexity of graph partitioning problems, Discrete Appl. Math., 57 (1995), pp. 193-212.
31. R. J. Lipton, E. Markakis, and A. Mehta, Playing large games using simple strategies, in Proceedings of the 4th ACM Conference on Electronic Commerce, ACM, New York, 2003, pp. 36-41.
32. F. McSherry, Spectral partitioning of random graphs, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 529-537. (Pubitemid 33068414)
33. L. Minder and D. Vilenchik, Small clique detection and approximate Nash equilibria, in APPROX '09 / RANDOM '09: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer-Verlag, Berlin, Heidelberg, 2009, pp. 673-685.
34. T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turán, Canad. J. Math., 17 (1965), pp. 533-540.
35. C. H. Papadimitriou, The complexity of finding Nash equilibria, in Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, eds., Cambridge University Press, Cambridge, UK, 2007, pp. 29-51.
36. C. H. Papadimitriou, The search for equilibrium concepts, in SAGT 2008, Lecture Notes in Comput. Sci. 4997, Springer-Verlag, Berlin, 2008, pp. 1-3. (Pubitemid 351762789)
37. C. H. Papadimitriou and M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. System Sci., 53 (1996), pp. 161-170. (Pubitemid 126365597)
38. T. Roughgarden, Algorithmic game theory: Some greatest hits and future directions, in IFIP TCS, IFIP 273, G. Ausiello, J. Karhumäki, G. Mauri, and C.-H. L. Ong, eds., Springer, Boston, 2008, pp. 21-42.
39. P. G. Spirakis, Approximate equilibria for strategic two person games, in SAGT 2008, Lecture Notes in Comput. Sci. 4997, Springer, Berlin, 2008, pp. 5-21. (Pubitemid 351762791)
40. H. Tsaknakis and P. G. Spirakis, An optimization approach for approximate Nash equilibria, in WINE 2007, Lecture Notes in Comput. Sci. 4858, Springer, Berlin, 2007, pp. 42-56.