Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Equivalence of two-sided stable matching

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this article, we study a one-to-many two-sides matching problem. This one-to-many two-sides matching problem can be converted into one-to-one two-sides matching problem, and the equivalence between them is proved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9–15

    Article  MathSciNet  Google Scholar 

  • Irving RW, Manlove DF, Scott S (2000) The hospitals/residents problem with ties. In: Scandinavian workshop on algorithm theory. Springer, pp 259–271

  • Irving RW, Manlove DF, Scott S (2003) Strong stability in the hospitals/residents problem. In: Annual symposium on theoretical aspects of computer science. Springer, pp 439–450

  • Kavitha T, Mehlhorn K, Michail D, Paluch K (2004) Strongly stable matchings in time o (nm) and extension to the hospitals-residents problem. In: Annual symposium on theoretical aspects of computer science. Springer, pp 222–233

  • McDermid EJ, Manlove DF (2010) Keeping partners together: algorithmic results for the hospitals/residents problem with couples. J Comb Optim 19(3):279–303

    Article  MathSciNet  Google Scholar 

  • Roth AE (1986) On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica 54(2):425–427

    Article  MathSciNet  Google Scholar 

  • Vate JHV (1989) Linear programming brings marital bliss. Oper Res Lett 8(3):147–153

    Article  MathSciNet  Google Scholar 

  • Yang Y, Luo S, Fan J, Zhou X, Fu C, Tang G (2017) Study on specialist outpatient matching appointment and the balance matching model. J Comb Optim. https://doi.org/10.1007/s10878-017-0208-z

    Article  Google Scholar 

  • Zhang F, Li J, Fan J, Shen H, Shen J, Yu H (2017) Three-dimensional stable matching with hybrid preferences. J Comb Optim. https://doi.org/10.1007/s10878-017-0231-0

    Article  Google Scholar 

Download references

Acknowledgements

This study was funded by the National Natural Science Foundation of China (Item Numbers: 71371120, 71520107003) as well as the Shanghai Science Committee of China (Item Number: 17495810500). We would like to express our heartfelt thanks.

Author information

Authors and Affiliations

  1. Shanghai University, Shanghai, 200444, China

    Liwei Zhong & Yanqin Bai

Authors
  1. Liwei Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yanqin Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yanqin Bai.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhong, L., Bai, Y. Equivalence of two-sided stable matching. J Comb Optim 36, 1380–1387 (2018). https://doi.org/10.1007/s10878-018-0308-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0308-4

Keywords

Search

Navigation