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].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
