An algorithm to compute the full set of many-to-many stable matchings
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ahmet Alkan, 2001. "original papers : On preferences over subsets and the lattice structure of stable matchings," Review of Economic Design, Springer;Society for Economic Design, 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.
- Marilda Sotomayor, 1999. "The lattice structure of the set of stable outcomes of the multiple partners assignment game," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(4), pages 567-583.
- Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
- 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.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014.
"On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.
- Paula Jaramillo & Kagi Cagatay & Flip Klijn, 2012. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," DOCUMENTOS DE TRABAJO 009997, UNIVERSIDAD DEL ROSARIO.
- Paula Jaramillo & Ça?atay Kay? & Flip Klijn, 2012. "On the Exhaustiveness of Truncation and Dropping Strategies in Many-to-Many Matching Markets," Working Papers 632, Barcelona Graduate School of Economics.
- Paula Jaramillo & Cagatay Kay & Flip Klijn, 2012. "On the Exhaustiveness of Truncation and Dropping Strategies in Many-to-Many Matching Markets," DOCUMENTOS CEDE 010316, UNIVERSIDAD DE LOS ANDES-CEDE.
- Alvin Roth, 2008.
"Deferred acceptance algorithms: history, theory, practice, and open questions,"
International Journal of Game Theory,
Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
- Alvin E Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Levine's Bibliography 843644000000000283, UCLA Department of Economics.
- 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, 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.
- Echenique, Federico & Yenmez, Mehmet B., 2005. "A Solution to Matching with Preferences over Colleagues," Working Papers 1226, California Institute of Technology, Division of the Humanities and Social Sciences.
- Chen, Ning & Li, Mengling, 2013. "Ties matter: improving efficiency in course allocation by introducing ties," MPRA Paper 47031, University Library of Munich, Germany.
- Klijn, Flip & Yazıcı, Ayşe, 2014.
"A many-to-many ‘rural hospital theorem’,"
Journal of Mathematical Economics,
Elsevier, vol. 54(C), pages 63-73.
- 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).
- Flip Klijn & Ayse Yazici, 2014. "A Many-to-Many "Rural Hospital Theorem"," Working Papers 567, Barcelona Graduate School of Economics.
- Kominers, Scott Duke, 2010. "Matching with preferences over colleagues solves classical matching," Games and Economic Behavior, Elsevier, vol. 68(2), pages 773-780, March.
- repec:spr:jogath:v:46:y:2017:i:1:d:10.1007_s00182-015-0525-3 is not listed on IDEAS
- Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'Econométrie et d'Economie politique (DEEP) 14.07, Université de Lausanne, Faculté des HEC, DEEP.
- Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.
- Papai, Szilvia, 2004.
"Unique stability in simple coalition formation games,"
Games and Economic Behavior,
Elsevier, vol. 48(2), pages 337-354, August.
- Szilvia Papai, 2000. "Unique Stability in Simple Coalition Formation Games," Econometric Society World Congress 2000 Contributed Papers 1537, Econometric Society.
More about this item
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:47:y:2004:i:2:p:187-210. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.