Efficient Resource Allocation Under Acceptant Substitutable Priorities
12 Pages Posted: 21 Feb 2010
Date Written: December 30, 2009
The paper considers an assignment problem with acceptant substitutable priorities, and analyzes efficiency properties of the deferred acceptance rule. As a generalization of Ergin (2002), we come up with the acyclicity condition, and show that the priority structure is acyclical if and only if the the deferred acceptance rule is Pareto efficient. The class of acceptant substitutable priorities is a larger domain than that of responsive priorities, and Abdulkadiroglu and Sonmez (2003) implicitly point out that priorities we observe in practice violate responsiveness, but are still acceptant substitutable.
Keywords: Assignment, Deferred Acceptance Algorithm, Acceptant Substitutable Priorities, Pareto Efficient Rule, Acyclicity
JEL Classification: C78, D61
Suggested Citation: Suggested Citation