On algorithms for discrete and approximate Brouwer fixed points

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 323-330

  Chen, Xi ^a   Deng, Xiaotie ^b  

^a TSINGHUA UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximate fixed point; Fixed point theorem; Lipschitz function; Sperner's lemma

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; FUNCTIONS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATE FIXED POINT; FIXED POINT THEOREM; LIPSCHITZ FUNCTIONS; SPERNER'S LEMMA;

COMPUTATIONAL COMPLEXITY;

EID: 34848910771     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060638     Document Type: Conference Paper

References (42)

1. E. Altman, K. Avrachenkov, and C. Barakat. Tcp network calculus: The case of large delay-bandwidth product. In Proceedings of INFOCOM 2002.
2. K. Arrow and G. Debreu. Existence of an equilibrium for a competitive economy. Econometrica, 22:265-290, 1954.
3. S. Banach. Sur les opérations dans les ensembles abstraits et leur application aux Équations intégrales. Fundamenta. Mathematicae, 3:133-181, 1922.
4. L. Brouwer. Über abbildung von mannigfaltigkeiten. Mathematische Annalen, 71:97-115, 1910.
5. N. Chen, X. Deng, X. Sun, and A. C.-C. Yao. Fisher equilibrium price with a class of concave utility functions. In ESA 2004, pages 169-179.
6. B. Codenotti and K. Varadarajan. Efficient computation of equilibrium prices for market with leontief utilities. In To appear in ICALP 2004.
7. R. Cole, Y. Dodis, and T. Roughgarden. Pricing network edges for heterogeneous selfish users. In STOC 2003, pages 521-530.
8. X. Deng, C. Papadimitriou, and S. Safra. On the complexity of equilibria. In STOC 2002, pages 67-71.
9. X. Deng, C. Papadimitriou, and S. Safra. On the complexity of price equilibrium. Journal of Computer and System Sciences, 67(2):311-324, 2003.
10. N. Devanur. The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results. In STOC 2004, pages 519-528.
11. N. Devanur, C. Papadimitriou, A. Saberi, and V. Vazirani. Market equilibrium via a primal-dual-type algorithm. In FOCS 2002, pages 389-395.
12. B. Eaves. Homotopies for computation of fixed points. Mathematical Programming, 3:1-22, 1972.
13. M. Hirsch, C. Papadimitriou, and S. Vavasis. Exponential lower bounds for finding brouwer fixed points. J. Complexity, 5:379-416, 1989.
14. Z. Huang, L. Khachiyan, and K. Sikorski. Approximating fixed points of weakly contracting mappings. J. Complexity, 15:200-213, 1999.
15. T. Iimura. A discrete fixed point theorem and its applications. Journal of Mathematical Economics, 39:725-742, 2003.
16. T. Iimura, K. Murota, and A. Tamura. Discrete fixed point theorem reconsidered. METR, 9 2004.
17. K. Jain. A polynomial time algorithm for computing the arrow-debreu market equilibrium for linear utilities. In FOCS 2004, pages 286-294.
18. K. Jain, M. Mahdian, and A. Saberi. Approximating market equilibria. In RANDOM-APPROX 2003, pages 98-108.
19. K. Jain, V. Vazirani, and Y. Ye. Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. In SODA 2005.
20. R. Kellogg, T. Li, and J. Yorke. Constructive proof of the brouwer fixed point theorem and computational results. SIAM J. Numer. Anal, 13:473-483, 1976.
21. K.-I. Ko. Computational complexity of fixed points and intersection points. J. Complexity, 11:265-292.
22. L. Kronecker. Über systeme von funktionen mehrerer variabeln. Montsh. Berl. Akad. Wiss., pages 159-163, 688-698, 1869.
23. H. Kuhn. Simplicial approximation of fixed points. Proceedings of National Academy of Science, USA, 61:1238-1242, 1968.
24. S. Low. A duality model of tcp and queue management algorithms. IEEE/ACM Transactions on Networking, 11(4):525-536, 2003.
25. A. Mehta, S. Shenker, and V. Vazirani. Profit-maximizing multicast pricing by approximating fixed points. In ACM Conference on Electronic Commerce, pages 218-219, 2003.
26. G. Meinardus. Invarianz bei linearen approximationen. Arch. Rational. Mech. Anal., 14:301-303, 1963.
27. O. Merrill. Applications and Extensions of an Algorithm that Computes Fixed Points of Certain Upper Semi-Continuous Point-to-Set Mappings. Phd thesis, University of Michigan, Annarbor, 1972.
28. J. F. Nash. Equilibrium points in n-person games. In Proceedings of NAS, 1950.
29. C. Papadimitriou. On graph-theoretic lemmata and complexity classes. In STOC 1990, pages 794-801.
30. J. Ortega and W. Rheinbolt. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.
31. C. Robinson. Dynamical Systems, Stability, Symbolic Dynamics, and Chaos. CRC Press, 1999.
32. H. Scarf. The approximation of fixed points of a continuous mapping. SIAM Journal on Applied Mathematics, 15:997-1007, 1967.
33. S. Shellman and K. Sikorski. A two-dimensional bisection envelope algorithm for fixed points. J. Complexity, 18(2):641-659, 2002.
34. S. Shellman and K. Sikorski. Algorithm 825: A deep-cut bisection envelope algorithm for fixed points. ACM Trans. Math. Soft., 29(3):309-325, 2003.
35. S. Shellman and K. Sikorski. A recursive algorithm for the infinity-norm fixed point problem. J. Complexity, 19(6):799-834, 2003.
36. K. Sikorski. Fast algorithms for the computation of fixed points. In R. Milanese and A.Vicino, editors, In Robustness in Identification and Control, pages 49-59. Plenum Press, New York, 1989.
37. K. Sikorski, C. Tsay, and H. Wozniakowski. An ellipsoid algorithm for the computation of fixed points. J. Complexity, 9:181-200, 1993.
38. K. Sikorski and H. Wozniakowski. Complexity of fixed points, i. J. Complexity, 3(4):388-405, 1987.
39. S. Smale. A convergent process of price adjustment process and global newton methods. Journal on Mathematical Economics, 3:107-120, 1976.
40. E. Sperner. Neuer beweis fur die Invarianz der dimensionszahl und des gebietes. Abhandlungen aus dem Mathematischen Seminar Universitat Hamburg, 6:265-272, 1928.
41. D. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. In FOCS 1996, pages 96-105.
42. Z. Yang. Computing equilibria and fixed points: The solution of nonlinear inequalities. Kluwer Academic Publishers, Dordrecht, 1999.