Pages that link to "Item:Q1072545"

The following pages link to On effectively computable realizations of choice functions (Q1072545):

Displaying 19 items.

• Choice and complexity (Q581191) (← links)
• The minimum degree of recursively representable choice functions (Q1072546) (← links)
• Microeconomic foundations of cyclical irregularities or ''chaos'' (Q1089240) (← links)
• Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
• Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
• On the independence of core-equivalence results from Zermelo-Fraenkel set theory (Q1263580) (← links)
• Rationality and bounded rationality (Q1378010) (← links)
• Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
• Effective choice functions and index sets (Q1820773) (← links)
• The computational difficulty of manipulating an election (Q1824524) (← links)
• Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
• Computable preference and utility (Q1961959) (← links)
• Non-computable rational expectations equilibria (Q2366196) (← links)
• (Q3032030) (← links)
• Effective Choice and Boundedness Principles in Computable Analysis (Q3083466) (← links)
• ECONOPHYSICS AND ECONOMIC COMPLEXITY (Q3603959) (← links)
• Production of Ideas by Means of Ideas: A Turing Machine Metaphor (Q4660034) (← links)
• Rights and Decentralized Computation (Q4660041) (← links)