In this article, I review two recent developments in the theory of computation of general equilibria. First, following Brown et al. (1996) several papers have developed globally convergent algorithms for the computation of general equilibria in models with incomplete asset markets. I review some of the developments in that area. Second, new developments in computational algebraic geometry lead to algorithms to compute effectively all equilibria of systems of polynomial equations. I point out some applications of these algorithms to general equilibrium theory.
Computation of general equilibria Gröbner bases Homotopy algorithms Incomplete asset markets Kuhn–Tucker conditions Multiple equilibria Newton–Kantarovich conditions Real business cycles Semi-algebraic economies Smale’s alpha method Tarski–Seidenberg th Uncertainty
This is a preview of subscription content, log in to check access.
Basu, S., R. Pollack, and M.-F. Roy. 2003. Algorithms in real algebraic geometry. New York: Springer.Google Scholar
Blum, L., F. Cucker, M. Shub, and S. Smale. 1998. Complexity and real computation. New York: Springer.CrossRefGoogle Scholar
Brown, D.J., P.M. DeMarzo, and B.C. Eaves. 1996. Computing equilibria when asset markets are incomplete. Econometrica 64: 1–27.CrossRefGoogle Scholar
Codenotti, B., S. Pemmaraju, and K. Varadarajan. 2004. Algorithms column: The computation of market equilibria. ACM SIGACT News 35(4): 23–37.CrossRefGoogle Scholar