This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

A Solution to Matching with Preferences over Colleagues

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Echenique, Federico
Yenmez, Mehmet B.

Additional information is available for the following registered author(s):

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.hss.caltech.edu/SSPapers/sswp1226c.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by California Institute of Technology, Division of the Humanities and Social Sciences in its series Working Papers with number 1226.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length: 25 pages
Date of creation: Jun 2005
Date of revision:
Publication status: Published in Games and Economic Behavior 59 (2007) 46-71.
Handle: RePEc:clt:sswopa:1226

Contact details of provider:
Postal: Working Paper Assistant, Division of the Humanities and Social Sciences, 228-77, Caltech, Pasadena CA 91125
Phone: 626 395-4065
Fax: 626 405-9841
Email:
Web page: http://www.hss.caltech.edu/ss

Order Information:
Postal: Working Paper Assistant, Division of the Humanities and Social Sciences, 228-77, Caltech, Pasadena CA 91125
Email:

For technical questions regarding this item, or to correct its listing, contact: (Victoria Mason).

Related research
Keywords: matching markets core lattice Gale-Shapley algorithm

Other versions of this item:

This paper has been announced in the following NEP Reports: References listed on IDEAS
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.:
  1. Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001. "Core in a simple coalition formation game," Social Choice and Welfare, Springer, vol. 18(1), pages 135-153. [Downloadable!] (restricted)
    Other versions:
  2. Adachi, Hiroyuki, 2000. "On a characterization of stable matchings," Economics Letters, Elsevier, vol. 68(1), pages 43-49, July. [Downloadable!] (restricted)
  3. 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. [Downloadable!] (restricted)
    Other versions:
  4. Echenique, Federico & Oviedo, Jorge, 2003. "A Theory of Stability in Many-to-Many Matching Markets," Working Papers 1185, California Institute of Technology, Division of the Humanities and Social Sciences. [Downloadable!]
    Other versions:
  5. Klaus, Bettina & Klijn, Flip, 2005. "Stable matchings and preferences of couples," Journal of Economic Theory, Elsevier, vol. 121(1), pages 75-106, March. [Downloadable!] (restricted)
  6. 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. [Downloadable!] (restricted)
  7. 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. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, 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.)

  1. Pablo Revilla, 2007. "Many-to-One Matching when Colleagues Matter," Working Papers 2007.87, Fondazione Eni Enrico Mattei. [Downloadable!]
    Other versions:
  2. Mumcu, Ayse & Saglam, Ismail, 2006. "One-to-One Matching with Interdependent Preferences," MPRA Paper 1908, University Library of Munich, Germany. [Downloadable!]
  3. 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. [Downloadable!] (restricted)
    Other versions:
  4. Dinko Dimitrov & Emiliya Lazarova, 2008. "Coalitional Matchings," Working Papers 2008.45, Fondazione Eni Enrico Mattei. [Downloadable!]
Statistics
Access and download statistics

Did you know? A tutorial is available.

This page was last updated on 2008-10-6.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.