Abstract
Consider the college admissions problem. Let us say that (student and college) preferences are student-oriented iff whenever two students disagree about the ranking of two colleges, each one of the two students is ranked higher by the college he prefers than the other student. We show that when preferences are oriented there is a unique stable matching, and that no other matching, stable or not, is weakly preferred by every student.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
