论文信息 - Sandwich method for finding fixed points

Sandwich method for finding fixed points

The sandwich method is a technique which uses simplicial subdivision to compute Brouwer fixed points and solve related problems, such as finding general economic equilibria. This paper presents a self-contained account of the sandwich method. It introduces the basic concepts of simplicial subdivision and the process ofsandwiching, demonstrates the convergence properties of the algorithm, and discusses the nature of the approximation. A concise description of the algorithm is provided, and a small sample of computational experience is reported on.

H. Kuhn | J. MacKinnon

[1] Harold W. Kuhn,et al. Some Combinatorial Lemmas in Topology , 1960, IBM J. Res. Dev..

[2] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .

[3] I. Fisher,et al. Ten economic studies in the tradition of Irving Fisher , 1967 .

[4] Herbert E. Scarf,et al. The Approximation of Fixed Points of a Continuous Mapping , 1967 .

[5] H. Kuhn. Simplicial approximation of fixed points. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[6] K. Arrow,et al. General Competitive Analysis , 1971 .

[7] B. Curtis Eaves,et al. Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..

[8] B. Curtis Eaves,et al. Homotopies for computation of fixed points , 1972, Math. Program..

[9] H. Scarf. The computation of equilibrium prices , 1973 .

[10] Herbert E. Scarf,et al. The Computation of Economic Equilibria , 1974 .