Strategy space reduction for feasible implementation of Walrasian performance

From MaRDI portal





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.











This page was built for publication: Strategy space reduction for feasible implementation of Walrasian performance

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