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

We study the trade-off between stability and students' welfare in school choice problems. We call a matching weakly stable if none of its blocking pairs can be matched in a more stable matching–one with a weakly smaller set of blocking pairs. A matching is said to be self-constrained efficient...