Efficient assignment respecting priorities
A widespread practice in assignment of heterogeneous indivisible objects is to prioritize some recipients over others depending on the type of the object. Leading examples include assignment of public school seats, and allocation of houses, courses, or offices. Each object comes with a coarse priority ranking over recipients. Respecting such priorities constrains the set of feasible assignments, and therefore might lead to inefficiency, highlighting a tension between respecting priorities and Pareto efficiency. Via an easily verifiable criterion, we fully characterize priority structures under which the constrained efficient assignments do not suffer from such welfare loss, and the constrained efficient rule (CER) is indeed efficient. We also identify the priority structures for which the CER is singleton-valued and group strategy-proof.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:145:y:2010:i:3:p:1269-1282. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.