Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/217066
Authors: 
Dur, Umut Mert
Gitmez, A. Arda
Yilmaz, Özgür
Year of Publication: 
2019
Citation: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 14 [Year:] 2019 [Issue:] 4 [Pages:] 1309-1346
Abstract: 
We generalize the school choice problem by defining a notion of allowable priority violations. In this setting, a weak axiom of stability (partial stability) allows only certain priority violations. We introduce a class of algorithms called the Student Exchange under Partial Fairness (SEPF). Each member of this class gives a partially stable matching that is not Pareto dominated by another partially stable matching (i.e. constrained efficient in the class of partially stable matchings). Moreover, any constrained efficient matching that Pareto improves upon a partially stable matching can be obtained via an algorithm within the SEPF class. We characterize the unique algorithm in the SEPF class satisfying a desirable incentive property. The extension of the model to an environment with weak priorities enables us to provide a characterization result which proves the counterpart of the main result in Erdil and Ergin (2008).
Subjects: 
School choice
stability
efficiency
JEL: 
C78
D61
D78
I20
Persistent Identifier of the first edition: 
Creative Commons License: 
https://creativecommons.org/licenses/by-nc/4.0/
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.