Efficient Resource Allocation Under Acceptant Substitutable Priorities

12 Pages Posted: 21 Feb 2010

See all articles by Taro Kumano

Taro Kumano

Washington University in St. Louis

Date Written: December 30, 2009

Abstract

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

Kumano, Taro, Efficient Resource Allocation Under Acceptant Substitutable Priorities (December 30, 2009). Available at SSRN: https://ssrn.com/abstract=1556438 or http://dx.doi.org/10.2139/ssrn.1556438

Taro Kumano (Contact Author)

Washington University in St. Louis ( email )

One Brookings Drive
Campus Box 1208
Saint Louis, MO

Register to save articles to
your library

Register

Paper statistics

Downloads
142
Abstract Views
1,185
rank
210,906
PlumX Metrics