Iris, DorukOzkal-Sanver, Ipek2024-07-182024-07-1820111545-2921https://hdl.handle.net/11411/8581We consider a two-sided many-to-one matching model where universities offer scholarships to students. We show that every stable matching rule is manipulable by a university via destroying endowments under a fairly wide class of scholarship rules. Furthermore, we show that the set of Nash equilibria of the destruction game and the set of stable matchings may be disjoint.eninfo:eu-repo/semantics/closedAccessManilulation via endowments in university-admission problemArticle2-s2.0-8485530869529584Q3295231N/AWOS:000219584500022