Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lemke, C. M., andHowson, J. T.,Equilibrium Points of Bimatrix Games, Journal of the Society for Industrial and Applied Mathematics, Vol. 12, pp. 413–423, 1964.
Scarf, H. E.,The Approximation of Fixed Points of a Continuous Mapping, SIAM Journal on Applied Mathematics, Vol. 15, pp. 1328–1343, 1967.
Scarf, H. E.,On the Computation of Equilibrium Prices, Ten Economic Studies in the Tradition of Irving Fisher, Edited by W. Fellneret al., John Wiley and Sons, New York, New York, 1967.
Kuhn, H. W.,Simplicial Approximation of Fixed Points, Proceedings of the National Academy of Sciences, USA, Vol. 61, pp. 1238–1242, 1968.
Eaves, B. C.,Homotopies for Computation of Fixed Points, Mathematical Programming, Vol. 3, pp. 1–22, 1972.
Eaves, B. C., andSaigal, R.,Homotopies for Computation of Fixed Points on Unbounded Regions, Mathematical Programming, Vol. 3, pp. 225–237, 1972.
Merrill, O. H.,Applications and Extensions of an Algorithm that Computes Fixed Points of Certain Non-empty Convex Upper Semi-continuous Point to Set Mappings, University of Michigan, Department of Industrial Engineering, Technical Report No. 71-7, 1971.
Merrill, O. H.,Applications and Extensions of an Algorithm that Computes Fixed Points of Certain Upper Semi-continuous Point to Set Mappings, University of Michigan, Ph.D. Thesis, 1972.
Fisher, M. L., Gould, F. J., andTolle, J. W.,A New Simplicial Approximation Algorithm with Restarts: Relations Between Convergence and Labelling, Proceedings of the Conference on Computing Fixed Points with Applications, Department of Mathematical Sciences, Clemson University, Clemson, South Carolina, 1975.
Scarf, H. E., with the collaboration ofHansen, T.,The Computation of Economic Equilibria, Yale University Press, New Haven, Connecticut, 1973.
Arrow, K. J., andHahn, F. H.,General Competitive Analysis, Holden-Day, San Francisco, California, 1971.
MacKinnon, J. G.,Solving Economic General Equilibrium Models by the Sandwich Method, Proceedings of the Conference on Computing Fixed Points with, Applications, Department of Mathematical Sciences, Clemson University, Clemson, South Carolina, 1975.
Kuhn, H. W.,Some Combinatorial Lemmas in Topology, I.B.M. Journal of Research and Development, Vol. 4, pp. 508–524, 1960.
Author information
Authors and Affiliations
Additional information
Communicated by A. Miele
The research of this author has been supported by the National Science Foundation under Grant No. GP-35698X.
The research of this author has been supported by the Canada Council.
Rights and permissions
About this article
Cite this article
Kuhn, H.W., MacKinnon, J.G. Sandwich method for finding fixed points. J Optim Theory Appl 17, 189–204 (1975). https://doi.org/10.1007/BF00933874
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00933874