A solution to matching with preferences over colleagues

  • Federico Echenique
  • , M. Bumin Yenmez

    Research output: Contribution to journalArticlepeer-review

    67 Scopus citations

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)46-71
    Number of pages26
    JournalGames and Economic Behavior
    Volume59
    Issue number1
    DOIs
    StatePublished - Apr 2007

    Keywords

    • Coalition formation
    • College admission problem
    • Core
    • Simple matchings
    • Stability
    • Two-sided matching

    Fingerprint

    Dive into the research topics of 'A solution to matching with preferences over colleagues'. Together they form a unique fingerprint.

    Cite this