Journal of Combinatorial Optimization

, Volume 37, Issue 1, pp 330–336 | Cite as

Three-dimensional stable matching with hybrid preferences

  • Feng Zhang
  • Jing Li
  • Junxiang Fan
  • Huili Shen
  • Jian Shen
  • Hua YuEmail author


In this paper, we discuss the problem of stable matching with hybrid preferences among the three agent sets U, \(V_1\) and \(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\), and the agents of set \(V_1\) and \(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\), and the agents of set \(V_1 \times V_2\) has a strict preference to the agents of set U.


Three-dimensional stable matching Hybrid preference Algorithm 



This research is supported by the Shanghai Science Committee of China under Grant Number 17495810503, and the Applied Mathematical Subject of SSPU under Grant Number XXKPY1604. We would like to express our heartfelt thanks.


  1. Aldershof B, Carducci OM (1996) Stable matching with couples. Discrete Appl Math 68:203–207MathSciNetCrossRefzbMATHGoogle Scholar
  2. Bir P, McDermid E (2010) Three-sided stable matchings with cyclic preferences. Algorithmica 58:5–18MathSciNetCrossRefzbMATHGoogle Scholar
  3. Cechlrova K, Fleinerbc T, Manloved DF, McBrided I (2016) Stable matchings of teachers to schools. Theor Comput Sci 653:15–25MathSciNetCrossRefGoogle Scholar
  4. Chakraborty A, Citanna A, Ostrovsky M (2015) Subquadratic algorithms for succinct stable matching. Rev Econ Des 19:3–24MathSciNetzbMATHGoogle Scholar
  5. Chakraborty A, Citanna A, Ostrovsky M (2016) Almost-stable matchings in the hospitals/residents problem with couples.
  6. Cseha A, Manloveb DF (2016) Stable marriage and roommates problems with restricted edges: complexity and approximability. Discrete Optim 20:62–89MathSciNetCrossRefGoogle Scholar
  7. Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69:9–15MathSciNetCrossRefzbMATHGoogle Scholar
  8. Gelain M, Pini MS, Rossi F, Venable KB, Walsh T (2010) Local search for stable marriage problems with ties and incomplete lists. In: Zhang B-T, Orgun MA (eds) PRICAI 2010, LNAI 6230. pp 64–75Google Scholar
  9. Huang C-C (2010) Circular stable matching and 3-way kidney transplant. Algorithmica 58:137–150MathSciNetCrossRefzbMATHGoogle Scholar
  10. Kamiyama, N. (2015): Stable matchings with ties, master preference lists, and matroid constraints. In: Hoefer M (ed) SAGT 2015, LNCS 9347. pp 3–14Google Scholar
  11. Lazarova E, Borm P, Estvez-Fernndez Arantza (2016) Transfers and exchange-stability in two-sided matching problems. Theory Decis 81:53–71MathSciNetCrossRefzbMATHGoogle Scholar
  12. Li J (2013) A note on Roth’s consensus property of many-to-one matching. Math Oper Res 38(2):389–392MathSciNetCrossRefzbMATHGoogle Scholar
  13. Manlove DF (2015) The hospitals/residents problem. In: Encyclopedia of algorithms.
  14. McDermid EJ, Manlove DF (2010) Keeping partners together: algorithmic results for the hospitals/residents problem with couples. J Comb Optim 19(3):279–303MathSciNetCrossRefzbMATHGoogle Scholar
  15. Ng C, Hirschberg DS (1991) Three-dimensional stable matching problems. SIAM J Discrete Math 4(2):245–252MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2017

Authors and Affiliations

  • Feng Zhang
    • 1
  • Jing Li
    • 2
  • Junxiang Fan
    • 2
  • Huili Shen
    • 2
  • Jian Shen
    • 2
  • Hua Yu
    • 2
    Email author
  1. 1.Shanghai Polytechnic UniversityShanghaiChina
  2. 2.Shanghai General Hospital, School of MedicineShanghai Jiaotong UniversityShanghaiChina

Personalised recommendations