Matching with preferences over colleagues solves classical matching

Scott Kominers

Games and Economic Behavior, 2010, vol. 68, issue 2, 773-780

Abstract: In this note, we demonstrate that the problem of "many-to-one matching with (strict) preferences over colleagues" is actually more difficult than the classical many-to-one matching problem, "matching without preferences over colleagues." We give an explicit reduction of any problem of the latter type to a problem of the former type. This construction leads to the first algorithm which finds all stable matchings in the setting of "matching without preferences over colleagues," for any set of preferences. Our construction directly extends to generalized matching settings.

Keywords: Many-to-one; matching; Stability; Matching; algorithms (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899-8256(09)00195-X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:68:y:2010:i:2:p:773-780

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().