Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7373035 | Mathematical Social Sciences | 2017 | 35 Pages |
Abstract
In the bilateral assignment problem, source a holds the amount ra of resource of type a, while sink i must receive the total amount xi of the various resources. We look for assignment rules meeting the powerful separability property known as Consistency: “every subassignment of a fair assignment is fair”. They are essentially those rules selecting the feasible flow minimizing the sum âi,aW(yia), where W is smooth and strictly convex.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Herve Moulin,