Small clique detection and approximate Nash equilibria

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

Volumn 5687 LNCS, Issue , 2009, Pages 673-685

  Minder, Lorenz ^a   Vilenchik, Dan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PROBABILITY; NASH EQUILIBRIA; NASH EQUILIBRIUM; POLYNOMIAL-TIME; TWO-PLAYER GAMES;

AGRICULTURE; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; POLYNOMIAL APPROXIMATION; TECHNICAL PRESENTATIONS; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 70350614869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_50     Document Type: Conference Paper

References (15)

1. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM Journal on Computation 26(6), 1733-1748 (1997)
2. Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Structures and Algorithms 13(3-4), 457-466 (1998)
3. Alon, N., Spencer, J.: The Probabilistic Method. Wiley, Chichester (1992)
4. Chen, X., Deng, X., Teng, S.-H.: Computing Nash equilibria: Approximation and smoothed complexity. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, USA, pp. 604-612 (2006)
5. Conitzer, V., Sandholm, T.: Complexity Results about Nash Equilibria. In: 18th International Joint Conference on Artificial Intelligence, pp. 765-771 (2003)
6. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: STOC 2006: Proceedings of the 38th annual ACM Symposium on Theory of computing, USA, pp. 71-78 (2006)
7. Feige, U.: Relations between average case complexity and approximation complexity. In: STOC 2002: Proceedings of the 34th annual ACM Symposium on Theory of Computing, pp. 534-543 (2002)
8. Feige, U., Ofek, E.: Easily refutable subformulas of large random 3CNF formulas. Theory of Computing 3(1), 25-43 (2007)
9. Gilboa, I., Zemel, E.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior 1(1), 80-93 (1989)
10. Jerrum, M.: Large Cliques Elude the Metropolis Process. Random Structures and Algorithms 3(4), 347-359 (1992)
11. Juels, A., Peinado, M.: Hiding Cliques for Cryptographic Security. Designs, Codes and Cryptography 20(3), 269-280 (2000)
12. Hazan, E., Krauthgamer, R.: How hard is it to approximate the best Nash equilibrium? In: ACM-SIAM Symposium on Discrete Algorithms, USA, pp. 720-727 (2009)
13. Kučera, L.: Expected Complexity of Graph Partitioning Problems. Discrete Applied Mathematics 57(2-3), 193-212 (1995)
14. Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: 4th ACM conference on Electronic commerce, USA, pp. 36-41 (2003)
15. Tsaknakis, H., Spirakis, P.G.: An Optimization Approach for Approximate Nash Equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42-56. Springer, Heidelberg (2007)