The NP-completeness column: Finding needles in haystacks

ACM Transactions on Algorithms

Volumn 3, Issue 2, 2007, Pages

  Johnson, David S ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Fixed point; Game theory; Local search; Nash equilibrium; PLS; PPAD

Indexed keywords

NASH EQUILIBRIUM;

ALGORITHMS; COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; GAME THEORY; ONLINE SEARCHING;

COMPUTATIONAL COMPLEXITY;

EID: 34250201081     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1240233.1240247     Document Type: Article

References (71)

1. AGRAWAL, M., KAYAL, N., AND SAXENA, N. 2004. PRIMES is in P. Ann. Math. 160, 781-793.
2. ÁLVAREZ, C., OABARRÓ, J., AND SERNA, M. 2005. Pure Nash equilibria in games with a large number of actions. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 3618. Springer-Verlag, Berlin, 95-106.
3. ARYA, V., GARG, N., KHANDEKAR, R., MEYERSON, A., MUNAGALA, K., AND PANDIT, V. 2004. Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33, 544-562.
4. (Preliminary version in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM, New York, 2001, 21-29.)
5. BEAME, P., COOK, S., EDMONDS, J., IMPAGLIAZZO, R., AND PTTASSI, T. 1998. The relative complexity of NP search problems. J. Comput. Syst. Sci. 57, 3-19.
6. BLUM, M., AND IMPAGLIAZZO, R. 1987. Generic oracles and oracle classes. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, Calif., 118-126.
7. BROUWER, L. E. J. 1910. Über eneindeutige, stetige Transformationen von Flächen in sich. Math. Ann. 69, 176-180.
8. BURESH-OPPENHEIM, J., AND MORIOKA, T. 2004. Relativized NP search problems and prepositional proof systems. In Proceedings of the 19th Annual IEEE Conference on Computational Complexity. IEEE Computer Society, Los Alamitos, Calif., 54-67.
9. CHEN, X., AND DENG, X. 2005. 3-Nash is PPAD-complete. Tech. Rep. TR05-134, Electronic Colloquium on Computational Complexity.
10. CHEN, X., AND DENG, X. 2006a. On the complexity of 2D discrete fixed point problems. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 4051. Springer-Verlag, Berlin, 489-500.
11. CHEN, X., AND DENG, X. 2006b. Settling the complexity of two-player Nash equilibrium. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, Calif., 261-270.
12. CHEN, X., DENG, X., AND TENG, S.-H. 2006. Computing Nash equilibria: Approximation and smoothed complexity. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, Calif., 603-612.
13. COHEN, P. J. 1964. The independence of the continuum hypothesis. Proc. Nat. Acad. Sci 51, 105-110.
14. CONDON, A. 1992. The complexity of stochastic games. Inform. Comp. 96, 203-224.
15. CONDON, A. 1993. On algorithms for simple stochastic games. In Advances in Computational Complexity Theory, J.-Y. Cai, Ed. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13. American Mathematical Society, Providence, RI. 51-73.
16. DASKALAKIS, C., GOLDBERG, P. W., AND PAPADIMITRIOU, C. H. 2006. The complexity of computing a Nash equilibrium. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 71-78.
17. DASKALAKIS, C., GOLDBERG, P. W., AND PAPADIMITRIOU, C. H. 2007. The complexity of computing a Nash equilibrium. Submitted journal version of Daskalakis et al. [2006], Goldberg and Papadimitriou [2006], and Daskalakis and Papadimitriou [2005].
18. DASKALAKIS, C., AND PAPADIMTTRIOU, C. H. 2005. Three-player games are hard. Tech. Rep. TR05-139, Electronic Colloquium on Computational Complexity.
19. EHRENFEUCHT, A., AND MYCIELSKI, J. 1979. Positional strategies for mean payoff games. Int. J. Game Theory 8, 109-113.
20. EMERSON, E. A., AND JUTLA, C. S. 1991. Tree automata, mu-calculus and determinacy. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, Calif., 368-377.
21. ENGLERT, M., RÖGLIN, H., AND VÖCKING, B. 2007. Worst case and probabilistic analysis of the 2-opt algorithm for theTSP. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 1295-1304.
22. FABRIKANT, A., PAPADIMITRIOU, C. H., AND TALWAR, K. 2004. The complexity of pure Nash equilibria. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 604-612.
23. FENNER, S., FORTNOW, L., KURTZ, S., AND LI, L. 2003. An oracle builder's toolkit. Inform. Comp. 182, 95-136.
24. FORTNOW, L., AND SIPSER, M. 1988. Are there interactive protocols for co-NP languages? Inform. Proc. Lett. 28, 249-251.
25. FOSTER, J. A. 1993. The generic oracle hypothesis is false. Inform. Proc. Lett. 45, 59-62.
26. FRIEDL, K., IVANYOS, G., SANTHA, M., AND VERHOEVEN, Y. F. 2006. Locally 2-dimensional Sperner problems complete for polynomial parity argument classes. In Proceedings of the 6th Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science, vol. 3998. Springer-Verlag, Berlin, 380-391.
27. GOLDBERG, P. W., AND PAPADIMITRIOU, C. H. 2006. Reducibility among equilibrium problems. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 61-70.
28. GOTTLOB, G., GRECO, G., AND SCARCELLO, F. 2003. Pure Nash equilibria: Hard and easy games. In Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge. ACM, New York, 215-230.
29. GRIGNI, M. 2001. A Sperner lemma complete for PPA. Inform. Proc. Lett. 77, 255-259.
30. GURVICH, V. A., KARZANOV, A. V., AND KHACHIYAN, L. G. 1988. Cyclic games and an algorithm to find minimax cycle means in directed graphs. U.S.S.R. Comput. Math. Math. Phys. 28, 85-91.
31. HOMAN, C. M., AND THAKUR, M. 2003. One-way permutations and self-witnessing languages. J. Comput. Syst. Sci. 67, 608-622.
32. HOPFIELD, J. J. 1982. Neural networks and physical systems with emergent collective computational abilities. Proc. Nat. Acad. Sci. 79, 2554-2558.
33. JOHNSON, D. S., AND MCGEOCH, L. A. 1997. The traveling salesman problem: A case study in local optimization. In Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, Eds. John Wiley & Sons, Chichester, UK, 215-310. Preliminary version available at http://www.research.att.com/~dsj/papers.
34. JOHNSON, D. S., PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1988. How easy is local search? J. Comput. Syst. Sci. 37, 79-100.
35. JUBA, B. 2005. On the hardness of simple stochastic games. M.S. Thesis, Carnegie-Mellon University. Currently available from http://people.csail.mit.edu/bjuba/.
36. JURDZIŃSKI, M. 1998. Deciding the winner in parity games is in UP ∩ co-UP. Inform. Proc. Lett. 68, 119-124.
37. JURDZIŃSKI, M., PATERSON, M., AND ZWICK, U. 2006. A deterministic subexponential algorithm for solving parity games. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 117-123.
38. KAKUTANI, S. 1941. A generalization of Brouwer's fixed point theorem. Duke Math. J. 8, 457-459.
39. KARZANOV, A. V., AND LEBEDEV, V. N. 1993. Cyclical games with prohibitions. Math. Prog. 60, 277-293.
40. KERNIGHAN, B., AND LIN, S. 1970. An efficient heuristic for partitioning graphs. Bell Syst. Tech. J. 49, 291-307.
41. KHACHIYAN, L. O. 1979. A polynomial algorithm in linear programming. Dokl. Akad. Nauk. SSSR 20, 191-194.
42. KLEE, V., AND MINTY, G. J. 1972. How good is the simplex algorithm? In Inequalities III, O. Shisha, Ed. Academic Press, New York, 159-175.
43. KORUPOLU, M. R., PLAXTON, C. G., AND RAJARAMAN, R. 2000. Analysis of a local search heuristic for facility location problems. J. Alg. 37, 146-188.
44. KRENTEL, M. W. 1989. Structure in locally optimal solutions. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, Calif., 216-221.
45. LEMKE, C. E. 1965. Bimatrix equivalence points and mathematical programming. Mgmt. Sci. 11, 681-689.
46. LENSTRA, A. K., AND LENSTRA, H. W., EDS. 1993. Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1554. Springer-Verlag, Berlin.
47. LIN, S., AND KERNIGHAN, B. 1973. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 972-989.
48. LIPTON, R. J., AND MARKAKIS, E. 2004. Nash equilibria via polynomial equations. In Latin 2000: Theoretical Informatics. Lecture Notes in Computer Science, vol. 2976. Springer-Verlag, Berlin, 413-422.
49. LIPTON, R. J., MARKAKIS, E., AND MEHTA, A. 2003. Playing large games using simple strategies. In Proceedings of the 4th ACM Conference on Electronic Commerce. ACM, New York, 36-41.
50. LUEKER, G. 1976. Manuscript, Princeton University.
51. LUND, C., FORTNOW, L., KARLOFF, H., AND NISAN, N. 1992. Algebraic methods for proof systems. J. ACM 39, 859-868.
52. MEGIDDO, N., AND PAPADMITRIOU, C. H. 1991. On total functions, existence theorems and computational complexity. Theor. Comput. Sci. 81, 317-324.
53. MORIOKA, T. 2001. The classification of search problems and their definability in bounded arithmetic. M.S. thesis, University of Toronto. Also available as Tech. Rep. TR01-82, Electronic Colloquium on Computational Complexity.
54. NASH, J. F. 1951. Non-cooperative games. Ann. Math. 54, 286-295.
55. PAPADIMITRIOU, C. H. 1990. On graph-theoretic lemmata and complexity classes. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computing. IEEE Computer Society, Los Alamitos, Calif., 794-801. (Preliminary version of Papadimitriou [1994]).
56. PAPADMITRIOU, C. H. 1992. The complexity of the Lin-Kemighan heuristic for the traveling salesman problem. SIAM J. Comput. 21, 450-465.
57. PAPADIMITRIOU, C. H. 1994. The complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48, 498-532. (Journal version of Papadimitriou [1990].)
58. PAPADMITRIOU, C. H., SCHÄFFER, A. A., AND YANNAKAKIS, M. 1990. On the complexity of local search. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. ACM, New York, 438-445.
59. PAPADMITRIOU, C. H., AND STEIGLITZ, K. 1978. Some examples of difficult traveling salesman problems. Oper. Res. 26, 434-443.
60. POMERANCE, C. 1996. A tale of two sieves. Amer. Math. Soc. Not. 43, 1473-1485.
61. PRATT, V. 1975. Every prime has a succinct certificate. SIAM J. Comput. 4, 214-220.
62. PURI, A. 1995. Theory of hybrid systems and discrete event systems. Ph.D. thesis, University of California, Berkeley.
63. ROSENTHAL, R. W. 1973. A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65-67.
64. SCHÄFFER, A. A., AND YANNAKAKIS, M. 1991. Simple local search problems that are hard to solve. SIAM J. Comput. 20, 56-87.
65. SHAMIR, A. 1992. IP = PSPACE. J. ACM 39, 869-877.
66. SIPSER, M. 1982. On relativization and the existence of complete sets. In Proceedings of the 9th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 140. Springer-Verlag, Berlin, 523-531.
67. SPERNER, E. 1928. Neuer beweis für die Invarianz der Dimensionzahl und des Gebietes. Abh. math. Sem. Univ. Hamburg 6, 265-272.
68. VÖCKING, B. 2006. Congestion games: Optimization in competition. In Proceedings of the 2nd Algorithms and Complexity in Durham Workshop, H. Broersma, S. Dantchev, M. Johnson, and S. Szeider, Eds. Kings College Publications, London, 9-20.
69. YANNAKAKIS, M. 1990. The analysis of local search problems and their heuristics. In Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computing. Lecture Notes in Computer Science, vol. 415. Springer-Verlag, Berlin, Germany, 298-311.
70. YANNAKAKIS, M. 1997. Computational complexity. In Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, Eds. John Wiley & Sons, Chichester, UK, 19-55.
71. ZWICK, U., AND PATERSON, M. 1996. The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158, 343-359.