Abstract

We consider a situation where a student–school matching has already been temporarily decided, but unexpectedly the quotas of some schools are increased and/or some new schools enter. Furthermore, the school priority orders are allowed to be weak. We provide a polynomial-time algorithm to derive a student optimal stable matching under the profile of increased quotas that Pareto dominates the stable matching under that of initial quotas.

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 call

Disclaimer: 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.