Non-computability of competitive equilibrium
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 ).
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|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:14:y:1999:i:1:p:1-27. See general information about how to correct material in RePEc.
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.