An algorithm to compute the full set of many-to-many stable matchings
AbstractNo abstract is available for this item.
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 Mathematical Social Sciences.
Volume (Year): 47 (2004)
Issue (Month): 2 (March)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
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.:
- Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
- Marilda Sotomayor, 1999. "The lattice structure of the set of stable outcomes of the multiple partners assignment game," International Journal of Game Theory, Springer, vol. 28(4), pages 567-583.
- 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.
- Ahmet Alkan, 2001. "original papers : On preferences over subsets and the lattice structure of stable matchings," Review of Economic Design, Springer, vol. 6(1), pages 99-111.
- Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
- Flip Klijn, 2011.
"A Many-to-Many 'Rural Hospital Theorem',"
UFAE and IAE Working Papers
877.11, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Alvin E Roth, 2007.
"Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions,"
843644000000000283, UCLA Department of Economics.
- 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," NBER Working Papers 13225, National Bureau of Economic Research, Inc.
- 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, 2005. "A Solution to Matching with Preferences over Colleagues," Game Theory and Information 0506005, EconWPA.
- Federico Echenique & Mehmet B. Yenmez, 2005. "A Solution to Matching with Preferences over Colleagues," Working Papers 2005.120, Fondazione Eni Enrico Mattei.
- Kominers, Scott Duke, 2010. "Matching with preferences over colleagues solves classical matching," Games and Economic Behavior, Elsevier, vol. 68(2), pages 773-780, March.
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.