کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4631477 1340623 2011 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The computational content of Walras' existence theorem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
The computational content of Walras' existence theorem
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 217, Issue 13, 1 March 2011, Pages 6185-6191
نویسندگان
,