Strategy space reduction for feasible implementation of Walrasian performance (Q1178177)
From MaRDI portal
| File:Ambox important.svg | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strategy space reduction for feasible implementation of Walrasian performance |
scientific article; zbMATH DE number 23231
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strategy space reduction for feasible implementation of Walrasian performance |
scientific article; zbMATH DE number 23231 |
Statements
Strategy space reduction for feasible implementation of Walrasian performance (English)
0 references
26 June 1992
0 references
The main purpose of this paper is to establish a new upper bound on the size of the strategy space that is needed to feasibly implement the constrained Walrasian correspondence. This new upper bound is \(n(m- 1)+3m+2n-9\) where \(m\) is the number of goods and \(n\) the number of agents. This bound is significantly lower then those available from the literature.
0 references
upper bound
0 references
size of the strategy space
0 references
constrained Walrasian correspondence
0 references
