The computational content of Walras’ existence theorem |
| |
Authors: | Matthew Hendtlass |
| |
Institution: | Department of Pure Mathematics, University of Leeds, Leeds LS2 9JT, United Kingdom |
| |
Abstract: | In Y. Tanaka, Undecidability of the Uzawa equivalence theorem and LLPO, Appl. Math. Comput. 201 (2008) 378-383] Yasuhito Tanaka showed that Walras’ existence theorem implies the nonconstructive lesser limited principle of omniscience (LLPO); it follows that Walras’ existence theorem does not admit a constructive proof. We give a constructive proof of an approximate version of Walras’ existence theorem from which the full theorem can be recovered with an application of LLPO. We then push Uzawa’s equivalence theorem to the level of approximate solutions, before considering economies with at most one equilibrium. |
| |
Keywords: | Constructive analysis Walrasian equilibrium Uzawa&rsquo s equivalence theorem Fan theorem |
本文献已被 ScienceDirect 等数据库收录! |
|