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)
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact email@example.com.