IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i4d10.1007_s10878-018-0308-4.html
   My bibliography  Save this article

Equivalence of two-sided stable matching

Author

Listed:
  • Liwei Zhong

    (Shanghai University)

  • Yanqin Bai

    (Shanghai University)

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.

Suggested Citation

  • Liwei Zhong & Yanqin Bai, 2018. "Equivalence of two-sided stable matching," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1380-1387, November.
    • Handle: RePEc:spr:jcomop:v:36:y:2018:i:4:d:10.1007_s10878-018-0308-4
    DOI: 10.1007/s10878-018-0308-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0308-4
    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-018-0308-4?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. Roth, Alvin E, 1986. "On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets," Econometrica, Econometric Society, vol. 54(2), pages 425-427, March.
    2. 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.
    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. Baodong Li & Yu Yang & Jiafu Su & Zhichao Liang & Sheng Wang, 2020. "Two-sided matching decision-making model with hesitant fuzzy preference information for configuring cloud manufacturing tasks and resources," Journal of Intelligent Manufacturing, Springer, vol. 31(8), pages 2033-2047, December.
    2. Qin Yang & Jinfeng Liu & Xing Liu & Cejun Cao & Wei Zhang, 2019. "A Two-Sided Matching Model for Task Distribution in Ridesharing: A Sustainable Operations Perspective," Sustainability, MDPI, vol. 11(7), pages 1-16, April.

    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. Roth, Alvin E & Xing, Xiaolin, 1997. "Turnaround Time and Bottlenecks in Market Clearing: Decentralized Matching in the Market for Clinical Psychologists," Journal of Political Economy, University of Chicago Press, vol. 105(2), pages 284-329, April.
    2. Afacan, Mustafa Og̃uz & Dur, Umut Mert, 2017. "When preference misreporting is Harm[less]ful?," Journal of Mathematical Economics, Elsevier, vol. 72(C), pages 16-24.
    3. 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.
    4. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    5. Salonen, Hannu & Salonen, Mikko A.A., 2018. "Mutually best matches," Mathematical Social Sciences, Elsevier, vol. 91(C), pages 42-50.
    6. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    7. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    8. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
    9. David Pérez-Castrillo & Marilda Sotomayor, 2023. "Constrained-optimal tradewise-stable outcomes in the one-sided assignment game: a solution concept weaker than the core," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(3), pages 963-994, October.
    10. Neme, Pablo & Oviedo, Jorge, 2021. "On the set of many-to-one strongly stable fractional matchings," Mathematical Social Sciences, Elsevier, vol. 110(C), pages 1-13.
    11. Charness, Gary & Kuhn, Peter, 2011. "Lab Labor: What Can Labor Economists Learn from the Lab?," Handbook of Labor Economics, in: O. Ashenfelter & D. Card (ed.), Handbook of Labor Economics, edition 1, volume 4, chapter 3, pages 229-330, Elsevier.
    12. Domenico Moramarco & Umutcan Salman, 2023. "Equal opportunities in many-to-one matching markets," Working Papers 649, ECINEQ, Society for the Study of Economic Inequality.
    13. Umut Dur & Onur Kesten, 2019. "Sequential versus simultaneous assignment systems and two applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(2), pages 251-283, September.
    14. Wu, Qingyun & Roth, Alvin E., 2018. "The lattice of envy-free matchings," Games and Economic Behavior, Elsevier, vol. 109(C), pages 201-211.
    15. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    16. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    17. Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018. "Stable project allocation under distributional constraints," Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
    18. Tayfun Sönmez, 1994. "Strategy-proofness in many-to-one matching problems," Review of Economic Design, Springer;Society for Economic Design, vol. 1(1), pages 365-380, December.
    19. 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.
    20. 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.

    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:36:y:2018:i:4:d:10.1007_s10878-018-0308-4. 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.