Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
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.