IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i1d10.1007_s10878-017-0231-0.html
   My bibliography  Save this article

Three-dimensional stable matching with hybrid preferences

Author

Listed:
  • Feng Zhang

    (Shanghai Polytechnic University)

  • Jing Li

    (Shanghai Jiaotong University)

  • Junxiang Fan

    (Shanghai Jiaotong University)

  • Huili Shen

    (Shanghai Jiaotong University)

  • Jian Shen

    (Shanghai Jiaotong University)

  • Hua Yu

    (Shanghai Jiaotong University)

Abstract

In this paper, we discuss the problem of stable matching with hybrid preferences among the three agent sets U, $$V_1$$ V 1 and $$V_2$$ V 2 . We consider two hybrid preferences. One is that the agents of set U has a strict preference to the agents of set $$V_1 \times V_2$$ V 1 × V 2 , and the agents of set $$V_1$$ V 1 and $$V_2$$ V 2 have a strict preference to the agents of set U respectively. The other is that the agents of set U has a strict preference to the agents of set $$V_1 \times V_2$$ V 1 × V 2 , and the agents of set $$V_1 \times V_2$$ V 1 × V 2 has a strict preference to the agents of set U.

Suggested Citation

  • Feng Zhang & Jing Li & Junxiang Fan & Huili Shen & Jian Shen & Hua Yu, 2019. "Three-dimensional stable matching with hybrid preferences," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 330-336, January.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0231-0
    DOI: 10.1007/s10878-017-0231-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0231-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-017-0231-0?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Eric J. McDermid & David F. Manlove, 2010. "Keeping partners together: algorithmic results for the hospitals/residents problem with couples," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 279-303, April.
    2. Emiliya Lazarova & Peter Borm & Arantza Estévez-Fernández, 2016. "Transfers and exchange-stability in two-sided matching problems," Theory and Decision, Springer, vol. 81(1), pages 53-71, June.
    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. Feng Zhang & Liwei Zhong, 2021. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 928-936, November.
    2. 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.
    3. Bin Li & Qianghua Wei & Xinye Zhou, 0. "Research on model and algorithm of TCM constitution identification based on artificial intelligence," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    4. Bin Li & Qianghua Wei & Xinye Zhou, 2021. "Research on model and algorithm of TCM constitution identification based on artificial intelligence," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 988-1003, November.
    5. Feng Zhang & Liwei Zhong, 0. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-9.
    6. Jing Fan & Hui Shi, 0. "A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    7. Jing Fan & Hui Shi, 2021. "A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 896-908, November.
    8. Jorge Arenas & Juan Pablo Torres-Martinez, 2024. "On Incentives in Three-Sided Markets," Working Papers wp558, University of Chile, Department of Economics.

    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. Liwei Zhong & Yanqin Bai, 2018. "Equivalence of two-sided stable matching," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1380-1387, November.
    2. Xi Chen & Zhiping Fan & Zhiwu Li & Xueliang Han & Xiao Zhang & Haochen Jia, 2015. "A two-stage method for member selection of emergency medical service," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 871-891, November.
    3. Mengzhuo Bai & Chunyang Ren & Yang Liu, 2015. "A note of reduced dimension optimization algorithm of assignment problem," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 841-849, November.
    4. Feng Zhang & Liwei Zhong, 0. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-9.
    5. Tamás Fleiner & Zsuzsanna Jankó & Ildikó Schlotter & Alexander Teytelboym, 2023. "Complexity of stability in trading networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 629-648, September.
    6. Arantza Estévez-Fernández & José Manuel Giménez-Gómez & María José Solís-Baltadano, 2019. "Sequential bankruptcy problems," Tinbergen Institute Discussion Papers 19-076/II, Tinbergen Institute.
    7. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Joerg & Manlove, David & Pettersson, William, 2021. "Stability in the hospitals/residents problem with couples and ties: Mathematical models and computational studies," Omega, Elsevier, vol. 103(C).
    8. Feng Zhang & Liwei Zhong, 2021. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 928-936, November.
    9. Ágnes Cseh & Brian C. Dean, 2016. "Improved algorithmic results for unsplittable stable allocation problems," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 657-671, October.
    10. Perach, Nitsan & Anily, Shoshana, 2022. "Stable matching of student-groups to dormitories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 50-61.
    11. Tam'as Fleiner & Zsuzsanna Jank'o & Ildik'o Schlotter & Alexander Teytelboym, 2018. "Complexity of Stability in Trading Networks," Papers 1805.08758, arXiv.org, revised Feb 2019.

    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:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0231-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.