A Solution to Matching with Preferences Over Colleagues
Caltech SS Working Paper No. 1226
38 Pages Posted: 23 Jun 2005
Date Written: September 2005
We study many-to-one matchings, such as the assignment of students to colleges, where the students have preferences over the other students who would attend the same college. It is well known that the core of this model may be empty, without strong assumptions on agents' preferences. We introduce a method that finds all core matchings, if any exist. The method requires no assumptions on preferences. Our method also finds certain partial solutions that may be useful when the core is empty.
Keywords: Matching markets, Core, Lattice, Gale-Shapley algorithm
JEL Classification: C65, C78
Suggested Citation: Suggested Citation