A new perspective on Kesten's school choice with consent idea
Qianfeng Tang () and
Jingsheng Yu
Journal of Economic Theory, 2014, vol. 154, issue C, 543-561
Abstract:
We revisit the school choice problem with consent proposed by Kesten [12], which seeks to improve the efficiency of the student-optimal deferred acceptance algorithm (DA) by obtaining students' consent to give up their priorities. We observe that for students to consent, we should use their consent only when their assignments are Pareto unimprovable. Inspired by this perspective, we propose a new algorithm which iteratively reruns DA after removing students who have been matched with underdemanded schools, together with their assignments. While this algorithm is outcome equivalent to Kesten's EADAM, it is more accessible to practitioners due to its computational simplicity and transparency on consenting incentives. We also adapt this algorithm for school choice problems with weak priorities to simplify the stable improvement cycles algorithm proposed by Erdil and Ergin [8].
Keywords: School choice; Deferred acceptance algorithm; Pareto efficiency; Matching (search for similar items in EconPapers)
JEL-codes: C78 D61 D78 I20 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (35)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0022053114001446
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:154:y:2014:i:c:p:543-561
DOI: 10.1016/j.jet.2014.10.002
Access Statistics for this article
Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell
More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Catherine Liu ().