Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games

DOI10.1016/0165-4896(92)90062-AzbMATH Open0753.90024OpenAlexW2081531739MaRDI QIDQ1196208FDOQ1196208

Alain A. Lewis

Publication date: 16 December 1992

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(92)90062-a

zbMATH Keywords

effective computabilityneoclassical mathematical economicsNP-complete complexitytotally discrete Hurwiczian resource allocation mechanisms

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Social choice and individual values
• The polynomial hierarchy and a simple model for competitive analysis
• NP-complete decision problems for binary quadratics
• Recursively enumerable vector spaces
• Arithmetic over the rings of all algebraic integers.
• The computational complexity of maximization and integration
• Nicht konstruktiv beweisbare Sätze der Analysis
• An infinite version of Arrow's theorem in the effective setting
• On effectively computable realizations of choice functions
• Recursive metric spaces
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Realization of Choice Functions
• Discrete allocation mechanisms: Dimensional requirements for resource- allocation mechanisms when desired outcomes are unbounded
• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making

Cited In (2)

• Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
• Rationality and bounded rationality

Recommendations

• Foundations of mathematical economics 👍 👎
• Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics 👍 👎
• Topics in mathematical economics and game theory. Essays in honor of Robert J. Aumann 👍 👎
• On the foundations of mathematical economics 👍 👎
• Mathematical Foundations of Game Theory 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games

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