IDEAS home Printed from https://ideas.repec.org/p/aoz/wpaper/99.html
   My bibliography  Save this paper

Cycles to Compute the Full Set of Many-to-many Stable Matchings

Author

Listed:
  • Agustín G. Bonifacio

    (Universidad Nacional de San Luis/CONICET)

  • Noelia Juarez

    (Universidad Nacional de San Luis/CONICET)

  • Pablo Neme

    (Universidad Nacional de San Luis/CONICET)

  • Jorge Oviedo

    (Universidad Nacional de San Luis/CONICET)

Abstract

In a many-to-many matching model in which agents’ preferences satisfy substitutability and the law of aggregate demand, we present an algorithm to compute the full set of stable matchings. This algorithm relies on the idea of “cycles in preferences” and generalizes the algorithm presented in Roth and Sotomayor (1990) for the one-to-one model.

Suggested Citation

  • Agustín G. Bonifacio & Noelia Juarez & Pablo Neme & Jorge Oviedo, 2021. "Cycles to Compute the Full Set of Many-to-many Stable Matchings," Working Papers 99, Red Nacional de Investigadores en Economía (RedNIE).
    • Handle: RePEc:aoz:wpaper:99
    as

    Download full text from publisher

    File URL: https://rednie.eco.unc.edu.ar/files/DT/99.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Charles Blair, 1988. "The Lattice Structure of the Set of Stable Matchings with Multiple Partners," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 619-628, November.
    3. Ahmet Alkan, 2002. "A class of multipartner matching markets with a strong lattice structure," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 19(4), pages 737-746.
    4. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    5. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    6. 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.
    7. Piotr Dworczak, 2021. "Deferred Acceptance with Compensation Chains," Operations Research, INFORMS, vol. 69(2), pages 456-468, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Agustin G. Bonifacio & Nadia Guiñazú & Noelia Juarez & Pablo Neme & Jorge Oviedo, 2024. "The lattice of envy-free many-to-many matchings with contracts," Theory and Decision, Springer, vol. 96(1), pages 113-134, February.
    2. Gregory Gutin & Philip R. Neary & Anders Yeo, 2022. "Finding all stable matchings with assignment constraints," Papers 2204.03989, arXiv.org, revised Oct 2023.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Agustin G. Bonifacio & Nadia Guiñazú & Noelia Juarez & Pablo Neme & Jorge Oviedo, 2024. "The lattice of envy-free many-to-many matchings with contracts," Theory and Decision, Springer, vol. 96(1), pages 113-134, February.
    2. 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.
    3. Juárez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022. "Lattice structure of the random stable set in many-to-many matching markets," Games and Economic Behavior, Elsevier, vol. 132(C), pages 255-273.
    4. Ayşe Yazıcı, 2017. "Probabilistic stable rules and Nash equilibrium in two-sided matching problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 103-124, March.
    5. 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.
    6. Assaf Romm, 2014. "Implications of capacity reduction and entry in many-to-one stable matching," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(4), pages 851-875, December.
    7. 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.
    8. Noelia Juarez & Paola B. Manasero & Jorge Oviedo, 2023. "Nash implementation in a many-to-one matching market," Papers 2305.13956, arXiv.org, revised Oct 2023.
    9. Bonifacio, Agustín G. & Guiñazú, Nadia & Juarez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022. "The lattice of worker-quasi-stable matchings," Games and Economic Behavior, Elsevier, vol. 135(C), pages 188-200.
    10. Paola B. Manasero & Jorge Oviedo, 2022. "General Manipulability Theorem for a Matching Model," Papers 2210.06549, arXiv.org.
    11. Chen, Peter & Egesdal, Michael & Pycia, Marek & Yenmez, M. Bumin, 2016. "Median stable matchings in two-sided markets," Games and Economic Behavior, Elsevier, vol. 97(C), pages 64-69.
    12. Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
    13. Dimitrov, Dinko & Lazarova, Emiliya A., 2008. "Coalitional Matchings," Coalition Theory Network Working Papers 37523, Fondazione Eni Enrico Mattei (FEEM).
    14. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    15. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
    16. Mustafa Oǧuz Afacan, 2016. "Characterizations of the cumulative offer process," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 531-542, October.
    17. 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.
    18. Peter Biro & Sofya Kiselgof, 2013. "College admissions with stable score-limits," CERS-IE WORKING PAPERS 1306, Institute of Economics, Centre for Economic and Regional Studies.
    19. Yang, Yi-You, 2020. "Rationalizable choice functions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 120-126.
    20. Somouaoga Bonkoungou, 2021. "Decentralized college admissions under single application," Review of Economic Design, Springer;Society for Economic Design, vol. 25(1), pages 65-91, June.

    More about this item

    Keywords

    Stable matchings; cyclic matching; substitutable preferences;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    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:aoz:wpaper:99. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Laura Inés D Amato (email available below). General contact details of provider: https://edirc.repec.org/data/redniar.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.