On the dimensionality of bounds generated by the Shapley–Folkman theorem
The Shapley–Folkman theorem places a scalar upper bound on the distance between a sum of non-convex sets and its convex hull. We observe that some information is lost when a vector is converted to a scalar to generate this bound and propose a simple normalization of the underlying space which mitigates this loss of information. As an example, we apply this result to the Anderson (1978) core convergence theorem, and demonstrate how our normalization leads to an intuitive, unitless upper bound on the discrepancy between an arbitrary core allocation and the corresponding competitive equilibrium allocation.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Starr, Ross M, 1969. "Quasi-Equilibria in Markets with Non-Convex Preferences," Econometrica, Econometric Society, vol. 37(1), pages 25-38, January.
- Anderson, Robert M, 1982. "A Market Value Approach to Approximate Equilibria," Econometrica, Econometric Society, vol. 50(1), pages 127-36, January.
- Anderson, Robert M, 1978. "An Elementary Core Equivalence Theorem," Econometrica, Econometric Society, vol. 46(6), pages 1483-87, November.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:48:y:2012:i:1:p:59-63. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.