IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v34y2024i3p1-13id1.html
   My bibliography  Save this article

On a many-sided matching problem with mixed preferences

Author

Listed:
  • Marcin Anholcer
  • Maciej Bartkowiak

Abstract

Motivated by recent results on lexicographic and cyclic preferences, we present new sufficient conditions for the existence of stable matching in many-sided matching problems. Here, our focus shifted towards integrating the two-sided matching problem, characterized by reciprocal preferences, with the many-sided matching problem, which involves cyclic preferences. In particular, we show that one of the configurations presented recently by Zhang and Zhong for three-sided matching problems can be generalized to more dimensions. In our setting, the preferences are cyclic and, in the case of all but two pairs of consecutive sets of agents, also reciprocal, which generalizes the three-set setting of Zhang and Zhong. Our approach can be also applied to generalize the problems with any system of cyclic preferences for which the existence of a stable matching is guaranteed.

Suggested Citation

  • Marcin Anholcer & Maciej Bartkowiak, 2024. "On a many-sided matching problem with mixed preferences," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(3), pages 1-13.
  • Handle: RePEc:wut:journl:v:34:y:2024:i:3:p:1-13:id:1
    DOI: 10.37190/ord240301
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2024vol34no3_1.pdf
    Download Restriction: no

    File URL: https://libkey.io/10.37190/ord240301?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Alkan, Ahmet, 1988. "Nonexistence of stable threesome matchings," Mathematical Social Sciences, Elsevier, vol. 16(2), pages 207-209, October.
    2. Naoyuki Kamiyama, 2014. "A New Approach to the Pareto Stable Matching Problem," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 851-862, August.
    3. Klimentova, Xenia & Biró, Péter & Viana, Ana & Costa, Virginia & Pedroso, João Pedro, 2023. "Novel integer programming models for the stable kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1391-1407.
    4. Eriksson, Kimmo & Sjostrand, Jonas & Strimling, Pontus, 2006. "Three-dimensional stable matching with cyclic preferences," Mathematical Social Sciences, Elsevier, vol. 52(1), pages 77-87, July.
    5. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    6. Feng Zhang & Liwei Zhong, 2021. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 928-936, November.
    7. Hofbauer, Johannes, 2016. "d-dimensional stable matching with cyclic preferences," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 72-76.
    8. Jorge Arenas & Juan Pablo Torres-Martínez, 2023. "Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-8, March.
    9. Perach, Nitsan & Anily, Shoshana, 2022. "Stable matching of student-groups to dormitories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 50-61.
    10. Gunter J. Hitsch & Ali Hortaçsu & Dan Ariely, 2010. "Matching and Sorting in Online Dating," American Economic Review, American Economic Association, vol. 100(1), pages 130-163, March.
    11. Danilov, V. I., 2003. "Existence of stable matchings in some three-sided systems," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 145-148, October.
    12. Biró, Péter & van de Klundert, Joris & Manlove, David & Pettersson, William & Andersson, Tommy & Burnapp, Lisa & Chromy, Pavel & Delgado, Pablo & Dworczak, Piotr & Haase, Bernadette & Hemke, Aline & J, 2021. "Modelling and optimisation in European Kidney Exchange Programmes," European Journal of Operational Research, Elsevier, vol. 291(2), pages 447-456.
    Full references (including those not matched with items on IDEAS)

    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. Jorge Arenas & Juan Pablo Torres-Martinez, 2022. "Incentives in Three-Sided Markets," Working Papers wp538, University of Chile, Department of Economics.
    2. Combe, Julien, 2022. "Matching with ownership," Journal of Mathematical Economics, Elsevier, vol. 98(C).
    3. Jorge Arenas & Juan Pablo Torres-Martínez, 2023. "Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-8, March.
    4. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    5. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    6. 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.
    7. Comola, Margherita & Fafchamps, Marcel, 2018. "An experimental study on decentralized networked markets," Journal of Economic Behavior & Organization, Elsevier, vol. 145(C), pages 567-591.
    8. Somdeb Lahiri, 2004. "Pair-wise envy free and stable matchings for two sided systems with techniques," Economics Bulletin, AccessEcon, vol. 3(15), pages 1-9.
    9. repec:ebl:ecbull:v:3:y:2004:i:15:p:1-9 is not listed on IDEAS
    10. Baratto, Marie & Crama, Yves & Pedroso, João Pedro & Viana, Ana, 2025. "Local stability in kidney exchange programs," European Journal of Operational Research, Elsevier, vol. 320(1), pages 20-34.
    11. Federico Echenique & Joseph Root & Fedor Sandomirskiy, 2024. "Stable matching as transportation," Papers 2402.13378, arXiv.org.
    12. Heo, Eun Jeong & Hong, Sunghoon & Chun, Youngsub, 2022. "Efficient use of immunosuppressants for kidney transplants," Journal of Health Economics, Elsevier, vol. 85(C).
    13. Hofbauer, Johannes, 2016. "d-dimensional stable matching with cyclic preferences," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 72-76.
    14. Kratz, Jörgen, 2024. "Conflicting objectives in kidney exchange," Journal of Economic Theory, Elsevier, vol. 217(C).
    15. Eriksson, Kimmo & Sjostrand, Jonas & Strimling, Pontus, 2006. "Three-dimensional stable matching with cyclic preferences," Mathematical Social Sciences, Elsevier, vol. 52(1), pages 77-87, July.
    16. Nicolò, Antonio & Sen, Arunava & Yadav, Sonal, 2019. "Matching with partners and projects," Journal of Economic Theory, Elsevier, vol. 184(C).
    17. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    18. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2020. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," NBER Working Papers 26767, National Bureau of Economic Research, Inc.
    19. Zhiwei Cui & Yan-An Hwang, 2017. "House exchange and residential segregation in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 125-147, March.
    20. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2020. "Matching with myopic and farsighted players," Journal of Economic Theory, Elsevier, vol. 190(C).
    21. Michael Bates & Michael Dinerstein & Andrew C. Johnston & Isaac Sorkin, 2022. "Teacher Labor Market Equilibrium and Student Achievement," CESifo Working Paper Series 9551, CESifo.

    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:wut:journl:v:34:y:2024:i:3:p:1-13:id:1. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.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.