An iterative allocation mechanism in the edgeworth box

Anbarci, N.; Yi, G.

Abstract

This paper considers an iterative allocation mechanism which resolves the problem of multiplicity of allocations given by a mechanism in commodity space. At each stage, the average of the extreme allocations is taken and used as the starting point of the next stage. As long as the mechanism is individually rational and Pareto optimal, this iterative procedure yields a unique final allocation which is also individually rational and Pareto optimal. (JEL C63, C71)

Citation

Anbarci, N., & Yi, G. (1998). An iterative allocation mechanism in the edgeworth box. International Advances in Economic Research, 4(3), 253-258. https://doi.org/10.1007/bf02294894

• Journal Article Type: Article
• Publication Date: 1998-08
• Deposit Date: Aug 17, 2018
• Journal: International Advances in Economic Research
• Print ISSN: 1083-0898
• Electronic ISSN: 1573-966X
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 4
• Issue: 3
• Pages: 253-258
• DOI: https://doi.org/10.1007/bf02294894
• Public URL: https://durham-repository.worktribe.com/output/1317047