Abstract
Improvements in computational methods have resulted in the faster solution of general equilibrium economic models This paper gives a nontechnical introduction to the octahedral algorithm for the solution of economic models.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E.L. Allgower and K. Georg, “Simplicial and continuation methods for approximating fixed points”, SIAM Review 22 (1980) 28–85.
K.J. Arrow and F.H. Hahn, General competitive analysis (Oliver and Boyd, Edinburgh, Holden-Day, San Francisco, 1971).
S.A. Awoniyi and M.J. Todd, “An efficient simplicial algorithm for computing a zero of a convex union of smooth functions”, Mathematical Programming 25 (1982) 83–108.
M.N. Broadie, “OCTASOLV user’s guide”, Systems Optimization Laboratory Technical Report 83-8, Department of Operations Research, Stanford University (Stanford, CA, 1983a).
M.N. Broadie, “Subdivisions and antiprisms for PL homotopy algorithms”, Systems Optimization Laboratory Technical Report 83-14, Department of Operations Research, Stanford University, (Stanford, CA, 1983b).
B.C. Eaves, “On the basic theorem of complementarity”, Mathematical Programming 1 (1971) 68–75.
B.C. Eaves, “A short course in solving equations with PL homotopies”, in: R.W. Cottle and C.E. Lemke, eds., Nonlinear programming, SIAM-AMS proceedings volume IX, American Mathematical Society (Providence, Rhode Island, 1976) pp. 73–143.
B.C. Eaves, “A view of complementary pivot theory (or solving equations with homotopies)”, in: C.V. Coffman and G.J. Fix, eds., Constructive approaches to mathematical models (Academic Press, 1979) pp. 153–170.
A. Koestler, The act of creation (Hutchinson, second Danube edition, London, 1976).
M. Kojima and Y. Yamamoto, “A unified approach to several restart fixed point algorithms for their implementation and a new variable dimension algorithm”, Discussion Paper Series No. 151, Institute of Socio-Economic Planning, University of Tsukuba, (Sakura, Ibaraki, Japan, 1982).
G. van der Laan and L.P. Seelen, “Efficiency and implementation of simplicial zero point algorithms”, Research Report No. 100, Department of Actuarial Sciences and Econometics, Vrije Universiteit (Amsterdam, The Netherlands, 1983).
G. van der Laan and A.J.J. Talman, “A class of simplicial restart fixed point algorithms without an extra dimension”, Mathematical Programming 20 (1981) 33–48.
C.E. Lemke and J.T. Howson, “Equilibrium points of bimatrix games”, SIAM Review 12 (1964) 413–423.
A.S. Manne and P.V. Preckel, “A three-region intertemporal model of energy, international trade and capital flows”, Technical Report, Department of Operations Research, Stanford University (Stanford, CA, 1983).
O.H. Merrill, “Applications, and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings”, Ph.D. Dissertation., Department of Industial, Engineering, University of Michigan, Ann Arbor, MI, 1972.
P. Preckel, “Intertemporal equilibrium models: Development and results”, Ph.D. Dissertation., Stanford University, (Stanford, CA, 1983).
R. Saigal, “On the convergence rate of algorithms for solving equations that are based, on methods of complementary pivoting”, Mathematics of Operations Research 2 (1977) 108–124.
H. Scarf, “The approximation of fixed points of a continuous mapping”, SIAM Journal of Applied Mathematics 15 (1967) 1328–1343.
H. Scarf and T. Hansen, The computation of economic equilibria (Yale University Press, New Haven, CT, 1973).
H. Scarf, “The computation of equilibrium prices”, in: H. Scarf and J. Shoven, eds., Applied general equilibrium analysis, (Cambridge University Press, Cambridge, 1984).
L.S. Shapley, “On balanced games without side payments”, in: T.C. Hu and S.M. Robinson, eds., Mathematical programming (Academic Press, New York, 1973) pp. 261–290.
M.J. Todd, The computation of fixed points and applications (Springer-Verlag, Heidelberg, New York, 1976).
M.J. Todd, “Global and local convergence and monotonicity results for a recent variable-dimension fixed point algorithm”, in: W. Forester, ed., Numerical solution of highly nonlinear problems (North-Holland, Amsterdam, 1980).
M.J. Todd, “PLALGO: A Fortran implementation of a piecewise-linear homotopy algorithm for solving systems of nonlinear equations”, Technical Report No. 452, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1981).
M.J. Todd, “An introduction to piecewise-linear homotopy algorithms for solving systems of equations”, in: P.R. Turner, ed., Topics in numerical analysis, Lecture notes in mathematics no. 965 (Springer-Verlag, Berlin-Heidelberg-New York, 1982) pp. 149–202.
M.J. Todd, “Efficient methods of computing economic equilibria”, in: H. Scarf and J. Shoven, eds., Applied general equilibrium analysis (Cambridge University Press, Cambridge, 1984).
A.H. Wright, “The octahedral algorithm, a new simplicial fixed point algorithm”, Mathematical Programming 21 (1981) 47–69.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Broadie, M.N. (1985). An introduction to the octahedral algorithm for the computation of economic equilibria. In: Manne, A.S. (eds) Economic Equilibrium: Model Formulation and Solution. Mathematical Programming Studies, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121029
Download citation
DOI: https://doi.org/10.1007/BFb0121029
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00916-7
Online ISBN: 978-3-642-00917-4
eBook Packages: Springer Book Archive