Matching with preferences over colleagues solves classical matching
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 68 (2010)
Issue (Month): 2 (March)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Many-to-one matching Stability Matching algorithms;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Alvin E. Roth, 2007.
"Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions,"
NBER Working Papers
13225, National Bureau of Economic Research, Inc.
- Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer, vol. 36(3), pages 537-569, March.
- Roth, Alvin, 2008. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Scholarly Articles 2579651, Harvard University Department of Economics.
- Alvin E Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Levine's Bibliography 843644000000000283, UCLA Department of Economics.
- Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
- Bettina Klaus & Flip Klijn, 2004.
"Median Stable Matching for College Admission,"
UFAE and IAE Working Papers
632.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC), revised 16 Feb 2006.
- Clark Simon, 2006. "The Uniqueness of Stable Matchings," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 6(1), pages 1-28, December.
- Dutta, Bhaskar & Masso, Jordi, 1997.
"Stability of Matchings When Individuals Have Preferences over Colleagues,"
Journal of Economic Theory,
Elsevier, vol. 75(2), pages 464-475, August.
- Dutta, B. & Masso, J., 1996. "Stability of Matchings when Individuals Have Preferences Over Colleagues," UFAE and IAE Working Papers 325.96, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Echenique, Federico & Yenmez, Mehmet B., 2005.
"A Solution to Matching with Preferences over Colleagues,"
1226, California Institute of Technology, Division of the Humanities and Social Sciences.
- Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
- Federico Echenique & Mehmet B. Yenmez, 2005. "A Solution to Matching with Preferences over Colleagues," Working Papers 2005.120, Fondazione Eni Enrico Mattei.
- Federico Echenique, 2005. "A Solution to Matching with Preferences over Colleagues," Game Theory and Information 0506005, EconWPA.
- Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
- John William Hatfield & Paul R. Milgrom, 2005.
"Matching with Contracts,"
American Economic Review,
American Economic Association, vol. 95(4), pages 913-935, September.
- Adachi, Hiroyuki, 2000. "On a characterization of stable matchings," Economics Letters, Elsevier, vol. 68(1), pages 43-49, July.
- Eeckhout, Jan, 2000. "On the uniqueness of stable marriage matchings," Economics Letters, Elsevier, vol. 69(1), pages 1-8, October.
- Dinko Dimitrov & Emiliya Lazarova, 2008. "Coalitional Matchings," Working Papers 2008.45, Fondazione Eni Enrico Mattei.
- Pablo Revilla, 2007.
"Many-to-One Matching when Colleagues Matter,"
2007.87, Fondazione Eni Enrico Mattei.
- Pablo Revilla, 2004. "Many-to-one Matching When Colleagues Matter," Economic Working Papers at Centro de Estudios Andaluces E2004/85, Centro de Estudios Andaluces.
- Martinez, Ruth & Masso, Jordi & Neme, Alejandro & Oviedo, Jorge, 2004. "An algorithm to compute the full set of many-to-many stable matchings," Mathematical Social Sciences, Elsevier, vol. 47(2), pages 187-210, March.
- Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2014.
"Constitutions and Social Networks,"
Working Papers Dissertations
02, University of Paderborn, Faculty of Business Administration and Economics.
- Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2014. "Constitutions and Social Networks," Working Papers CIE 74, University of Paderborn, CIE Center for International Economics.
- MAULEON, Ana & ROEHL, Nils & VANNETELBOSCH, Vincent, 2014. "Constitutions and social networks," CORE Discussion Papers 2014003, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- repec:pdn:wpaper:74 is not listed on IDEAS
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.