Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
type: Item
instance of: scholarly article
title: Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
zbMATH Open document ID: 0753.90024
DOI: 10.1016/0165-4896(92)90062-A
published in: Mathematical Social Sciences
publication date: 1992-12-16T00:00:00Z
review text: This paper discusses certain key issues of the effectiveness of certain mathematical constructions within mathematical economics and the theory of games. By effective, we mean recursive constructions and more generally, constructions that are recursively enumerable. This is a more precise notion than the unspecified concept of construction usually found in constructive analysis (e.g. Bishop's formulation). The advantage to our commitment to recursive constructions is that with the precision of the interpretation of effective, qualitative and quantitative measures of complexity can be obtained which are usually left unspecified in the latter frameworks. Among the results presented is a proof that for the case of totally discrete Hurwiczian resource allocation mechanisms of the form \(\pi=\langle E,M,A\langle h,g\rangle\rangle\) having binary quadratics as outcome and performance criteria, there is an R.E. (recursively enumerable) class \(\alpha=\{\pi_ j\}_{j<\omega}\) of such mechanisms whose realization is uniformly sub-recursive in NP-complete complexity. The complexity of this class is uniformly less than a class of \(p\)-stage multilinear programs: \[ {\mathcal L}=\{\langle\{A^ i_ j\}_{i\in I},\{x^ i_ j\}_{i\in I},b,\{c^ i_ j\}_{i\in I}\rangle\}_{j\in J}. \] The level of complexity for the Hurwiczian mechanisms \(\pi=\langle E,M,A\langle h,g\rangle\rangle\) that are binary quadratic as stipulated, is bounded by the complexity of the following ordinary problem: If \(\langle a_ 1,\dots,a_ n\rangle\) is an arbitrary sequence of integers, is \(\langle a_ 1\theta,\dots,a_ n\theta\rangle\) a solution to the integral equation: \[ \int^{2\pi}_ 0\left(\prod^ n_{j=1}(\cos(a_ j\theta))\right)d\theta. \]
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 77891
zbMATH Keywords: neoclassical mathematical economics
zbMATH Keywords: effective computability
zbMATH Keywords: totally discrete Hurwiczian resource allocation mechanisms
zbMATH Keywords: NP-complete complexity
author: Alain A. Lewis
MaRDI profile type: Publication
cites work: NP-complete decision problems for binary quadratics
cites work: Social choice and individual values
cites work: Q3679172
cites work: Q3803111
cites work: Q4052072
cites work: Realization of Choice Functions
cites work: Q5588318
cites work: The computational complexity of maximization and integration
cites work: Q4198056
cites work: Q5342860
cites work: Discrete allocation mechanisms: Dimensional requirements for resource- allocation mechanisms when desired outcomes are unbounded
cites work: The polynomial hierarchy and a simple model for competitive analysis
cites work: Q5812175
cites work: Q5343325
cites work: On effectively computable realizations of choice functions
cites work: An infinite version of Arrow's theorem in the effective setting
cites work: On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
cites work: Q5613949
cites work: Recursively enumerable vector spaces
cites work: Q4131648
cites work: Recursive metric spaces
cites work: A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
cites work: Q5573961
cites work: Arithmetic over the rings of all algebraic integers.
cites work: The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
cites work: Nicht konstruktiv beweisbare Sätze der Analysis
cites work: Q3260574
full work available at URL: 0165-4896(92)90062-a
OpenAlex ID: W2081531739
Recommended article: Q4938537
Recommended article: Q3468905
Recommended article: On the foundations of mathematical economics
Recommended article: Q5503208
Recommended article: Topics in mathematical economics and game theory. Essays in honor of Robert J. Aumann
Recommended article: Mathematical Foundations of Game Theory
Recommended article: Q4225818
Recommended article: Q3223417
Recommended article: Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
Recommended article: Foundations of mathematical economics
description: scientific article; zbMATH DE number 77891