Non-computability of competitive equilibrium
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
We 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 ).
Supplementary Material (0)
About this Article
- Non-computability of competitive equilibrium
Volume 14, Issue 1 , pp 1-27
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Key words and Phrases: Bounded rationality, Computability, General equilibrium, Recursive analysis.
- JEL Classification Numbers: D51, C68.
- Industry Sectors