Non-computability of competitive equilibrium
From MaRDI portal
Publication:1300680
DOI10.1007/S001990050281zbMATH Open0940.91040OpenAlexW2031657010WikidataQ29395588 ScholiaQ29395588MaRDI QIDQ1300680FDOQ1300680
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
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
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff
- Undecidability of Uzawa equivalence theorem and LLPO (Lesser limited principle of omniscience)
- 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)
