Non-computability of competitive equilibrium

DOI10.1007/S001990050281zbMath0940.91040OpenAlexW2031657010WikidataQ29395588 ScholiaQ29395588MaRDI QIDQ1300680

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

general equilibriumbounded rationalityrecursive analysiscomputability

Mathematics Subject Classification ID

General equilibrium theory (91B50)

Related Items (9)

Recursive equilibrium with price perfect foresight and a minimal state space ⋮ A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ Equilibria, fixed points, and complexity classes ⋮ Computable preference and utility ⋮ On the robustness of the competitive equilibrium: utility-improvements and equilibrium points ⋮ Computability of simple games: A characterization and application to the core ⋮ The computation of approximate competitive equilibrium is PPAD-hard ⋮ Model selection in utility-maximizing binary prediction ⋮ Connected choice and the Brouwer fixed point theorem

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