Pages that link to "Item:Q1300680"
From MaRDI portal
The following pages link to Non-computability of competitive equilibrium (Q1300680):
Displaying 13 items.
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- On the robustness of the competitive equilibrium: utility-improvements and equilibrium points (Q478114) (← links)
- Undecidability of Uzawa equivalence theorem and LLPO (Lesser limited principle of omniscience) (Q945261) (← links)
- The computation of approximate competitive equilibrium is PPAD-hard (Q975493) (← links)
- Uncomputability and undecidability in economic theory (Q1036534) (← links)
- Computable preference and utility (Q1961959) (← links)
- Model selection in utility-maximizing binary prediction (Q2024476) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- Recursive equilibrium with price perfect foresight and a minimal state space (Q2634134) (← links)
- On an ``important principle'' of Arrow and Debreu (Q2690362) (← links)
- A note on the concept of approximate equilibrium in economic theory (Q2873500) (← links)
- Connected choice and the Brouwer fixed point theorem (Q5223123) (← links)
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)
