Non-computability of competitive equilibrium
AbstractWe provide a "computable counterexample" to the Arrow-Debreu competitive equilibrium existence theorem . In particular, we find an exchange economy in which all components are (Turing) computable, but in which no competitive equilibrium is computable. This result can be interpreted as an impossibility result in both computability-bounded rationality (cf. Binmore , Richter and Wong ) and computational economics (cf. Scarf ). To prove the theorem, we establish a "computable counterexample" to Brouwer's Fixed Point Theorem (similar to Orevkov ) and a computable analogue of a characterization of excess demand functions (cf. Mas-Colell , Geanakoplos , Wong ).
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Economic Theory.
Volume (Year): 14 (1999)
Issue (Month): 1 ()
Note: Received: September 9, 1997; revised version: December 17, 1997
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm
Find related papers by JEL classification:
- D51 - Microeconomics - - General Equilibrium and Disequilibrium - - - Exchange and Production Economies
- C68 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computable General Equilibrium Models
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Prasad, Kislaya, 2009. "The rationality/computability trade-off in finite games," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 17-26, January.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006.
"Computability of simple games: A characterization and application to the core,"
437, University Library of Munich, Germany.
- Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
- David Colander & Richard P.F. Holt & J. Barkley Rosser, 2010.
"The Complexity Era in Economics,"
Middlebury College Working Paper Series
1001, Middlebury College, Department of Economics.
- Tolentino, P. E., 2004. "Computable Economics: the Arne Ryde Memorial Lecture Series: Kumaraswamy Velupillai (Ed.), Oxford University Press, Oxford, Vol. xiii, 2000, 222 pp., Index," Journal of Economic Behavior & Organization, Elsevier, vol. 54(3), pages 445-449, July.
- E. Gaffeo & M. Catalano & F. Clementi & D. Delli Gatti & M. Gallegati & A. Russo, 2006.
"Reflections on Modern Macroeconomics: Can We Travel Along a Safer Road?,"
- Gaffeo, E. & Catalano, M. & Clementi, F. & Delli Gatti, D. & Gallegati, M. & Russo, A., 2007. "Reflections on modern macroeconomics: Can we travel along a safer road?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 382(1), pages 89-97.
- Miyake, Mitsunobu, 2003. "Precise computation of a competitive equilibrium of the discrete land market model," Regional Science and Urban Economics, Elsevier, vol. 33(6), pages 721-743, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.