Speaker
Danya Pevchiv
Description
This paper studies the targeted college admission problem,
where students are matched to schools and firms simultaneously. We analyze conditions for stable matchings, demonstrating existence under structured preferences (e.g., homogeneous firm-school rankings or fixed capacities) and providing counterexamples where stability fails. An adapted
deferred acceptance algorithm is proposed for cases where stability is guaranteed.
