Paths beyond local search: A tight bound for randomized fixed-point computation

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 124-134

  Chen, Xi ^a   Teng, Shang Hua ^b  

^a TSINGHUA UNIVERSITY   (China)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FIXED-POINT COMPUTATION; LOCAL SEARCH (LS); QUERY COMPLEXITY;

COMPUTER SCIENCE; FOUNDATIONS;

FIBER OPTIC CHEMICAL SENSORS;

EID: 46749116440     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389486     Document Type: Conference Paper

References (39)

1. S. Aaronson. Lower bounds for local search by quantum arguments. In STOC 2004, pages 465-474.
2. D. Aldous. Minimization algorithms and random walk on the d-cube. Annals of Probability, 11(2):403-413, 1983.
3. K. Arrow and G. Debreu. Existence of an equilibrium for a competitive economy. Econometrica, 22(3):265-290, 1954.
4. P. Beame, S. Cook, J. Edmonds, R. Impagliazzo, and T. Pitassi. The relative complexity of NP search problems. J. Comput. Syst. Sci., 57:3-19, 1998.
5. L. Brouwer. Über abbildung von mannigfaltigkeiten. Mathematische Annalen, 71:97-115, 1910.
6. X. Chen and X. Deng. On algorithms for discrete and approximate Brouwer fixed points. In STOC 2005.
7. X. Chen and X. Deng. On the complexity of 2d discrete fixed point problem. In ICALP 2006, pages 489-500.
8. X. Chen and X. Deng. Settling the complexity of two-player Nash equilibrium. In FOCS 2006.
9. X. Chen, X. Deng, and S.-H. Teng. Computing Nash equilibria: Approximation and smoothed complexity. In FOCS 2006.
10. X. Chen and S.-H. Teng. Paths beyond local search: A nearly tight bound for randomized fixed-point computation. arXiv:cs/0702088, 2007.
11. H. Chernoff. Asymptotic efficiency for tests based on the sum of observations. Ann. Math. Stat., 23:493-507, 1952.
12. B. Codenotti, A. Saberi, K. Varadarajan, and Y. Ye. Leontief economies encode nonzero sum two-player games. ECCC, TR05-055, 2005.
13. G. Dantzig. Maximization of linear function of variables subject to linear inequalities. In T. Koopmans, editor, Activity Analysis of Production and Allocation, pages 339-347.
14. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a Nash equilibrium. In STOC 2006.
15. X. Deng, C. Papadimitriou, and S. Safra. On the complexity of price equilibria. Journal of Computer and System Sciences, 67(2):311-324, 2003.
16. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag New York, Inc., 1987.
17. K. Friedl, G. Ivanyos, M. Santha, and F. Verhoeven. On the black-box complexity of Sperner's lemma. In 15th FCT, pages 245-257, 2005.
18. M. Hirsch, C. Papadimitriou, and S. Vavasis. Exponential lower bounds for finding Brouwer fixed points. Journal of Complexity, 5:379-416, 1989.
19. L.-S. Huang and S.-H. Teng. On the approximation and smoothed complexity of Leontief market equilibria. ECCC, TR06-031, 2006.
20. T. Iimura, K. Murota, and A. Tamura. Discrete fixed point theorem reconsidered. Journal of Mathematical Economics, 41:1030-1036,2005.
21. D. Johnson, C. Papadimtriou, and M. Yannakakis. How easy is local search? J. Comput. Syst. Sci., 37(1):79-100, 1988.
22. N. Karmarkar. A new polynomial time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
23. V. Klee and G. Minty. How good is the simplex algorithm? In O. Shisha, editor, Inequalities - 111, pages 159-175. Academic Press, 1972.
24. C. Lemke and J. J.T. Howson. Equilibrium points of bimatrix games. J. Soc. Indust. Appl. Math., 12:413-423, 1964.
25. J. Nash. Equilibrium point in n-person games. Porceedings of the National Academy of the USA, 36(1):48-49, 1950.
26. Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Algorithms in Convex Programming, volume 13 of Studies in Applied Mathematics. SIAM, 1993.
27. J. Orlin, A. Punnen, and A. Schulz. Approximate local search in combinatorial optimization. In SODA 2004.
28. C. Papadimitriou. On inefficient proofs of existence and complexity classes. In Proceedings of the 4th Czechoslovakian Symposium on Combinatorics, 1991.
29. C. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, pages 498-532, 1994.
30. M. Santha and M. Szegedy. Quantum and classical query complexities of local search are polynomially related. In STOC 2004, pages 494-501.
31. R. Savani and B. von Stengel. Exponentially many steps for finding a nash equilibrium in a bimatrix game. In FOCS 2004, pages 258-267.
32. H. Scarf. The approximation of fixed points of a continuous mapping. SIAM Journal on Applied Mathematics, 15:997-1007, 1967.
33. H. Scarf. On the computation of equilibrium prices. In W. Fellner, editor, Ten Economic Studies in the Tradition of Irving Fisher. New York: John Wiley & Sons, 1967.
34. H. Scarf. The Computation of Economic Equilibria. Yale University Press, 1973.
35. E. Sperner. Neuer beweis fur die invarianz der dimensionszahl und des gebietes. Abhandlungen aus dem Mathematischen Seminar Universitat Hamburg, 6:265-272, 1928.
36. D. Spielman and S.-H. Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of ACM, 51 (3):385-463, 2004.
37. X. Sun and A.-C. Yao. On the quantum query complexity of local search in two and three dimensions. In FOCS 2006, pages 429-438.
38. A.-C. Yao. Probabilistic computations: Towards a unified measure of complexity. In FOCS 1977, pages 222-227.
39. S. Zhang. New upper and lower bounds for randomized and quantum local search. In STOC 2006, pages 634-643.