A Solution to Matching with Preferences over Colleagues

dc.creatorEchenique, Federico
dc.creatorYenmez, Mehmet B.
dc.date2017-04-01T18:03:13Z
dc.date.accessioned2026-07-09T03:03:42Z
dc.descriptionWe 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.
dc.identifierdoi:10.22004/ag.econ.12174
dc.identifierhttps://ageconsearch.umn.edu/record/12174/files/wp050120.pdf
dc.identifierhttp://ageconsearch.umn.edu/record/12174
dc.identifier.urihttp://hdl.handle.net/123456789/525731
dc.languageeng
dc.publisher
dc.sourcehttp://ageconsearch.umn.edu/record/12174
dc.titleA Solution to Matching with Preferences over Colleagues
dc.typeText

Archivos