Non-computability of competitive equilibrium

DOI10.1007/S001990050281MaRDI QIDQ1300680zbMATH OpenOpenAlexWikidataFDO

Authors Marcel K. Richter, Kam-Chau Wong

Publication date 10 May 2000

Published in Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001990050281

zbMATH Keywords

bounded rationalitygeneral equilibriumcomputabilityrecursive analysis

Mathematics Subject Classification ID

General equilibrium theory (91B50)

Recommendations

• A note on the concept of approximate equilibrium in economic theory
• Non-computable rational expectations equilibria
• The computation of approximate competitive equilibrium is PPAD-hard
• Algorithmic Applications in Management
• The existence and computation of competitive equilibria in markets with an indivisible commodity

Cited in

(13)

• Recursive equilibrium with price perfect foresight and a minimal state space
• The computation of approximate competitive equilibrium is PPAD-hard
• Uncomputability and undecidability in economic theory
• Model selection in utility-maximizing binary prediction
• Computable preference and utility
• Equilibria, fixed points, and complexity classes
• Computability of simple games: A characterization and application to the core
• On the robustness of the competitive equilibrium: utility-improvements and equilibrium points
• Undecidability of Uzawa equivalence theorem and LLPO (Lesser limited principle of omniscience)
• A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff
• A note on the concept of approximate equilibrium in economic theory
• Connected choice and the Brouwer fixed point theorem
• On an ``important principle of Arrow and Debreu

This page was built for publication: Non-computability of competitive equilibrium

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300680)