IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v82y2019icp272-284.html
   My bibliography  Save this article

Pareto stability in two-sided many-to-many matching with weak preferences

Author

Listed:
  • Chen, Ning
  • Li, Mengling

Abstract

This paper studies the two-sided matching problem with multi-unit capacities and weak preferences on both sides. The simultaneous presence of these two features complicates the problem greatly, because either can make a stable matching not necessarily Pareto efficient. To ensure both fairness and efficiency, a natural solution is Pareto stability, which requires both pairwise stability and Pareto efficiency. We introduce a computationally efficient algorithm to construct a Pareto stable matching. This result immediately implies the existence of a Pareto stable matching in the general many-to-many matching problem with weak preferences.

Suggested Citation

  • Chen, Ning & Li, Mengling, 2019. "Pareto stability in two-sided many-to-many matching with weak preferences," Journal of Mathematical Economics, Elsevier, vol. 82(C), pages 272-284.
    • Handle: RePEc:eee:mateco:v:82:y:2019:i:c:p:272-284
    DOI: 10.1016/j.jmateco.2019.03.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406819300400
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2019.03.005?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Mengling, 2020. "Ties matter: Improving efficiency in course allocation by allowing ties," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 354-384.
    2. Fisher, James C.D., 2020. "Existence of stable allocations in matching markets with infinite contracts: A topological approach," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 136-140.
    3. Chen, Yajing & Jiao, Zhenhua & Zhang, Yang & Zhao, Fang, 2021. "Resource allocation on the basis of priorities under multi-unit demand," Economics Letters, Elsevier, vol. 202(C).
    4. Sgroi, Filippo & Totaro, Teresa & Modica, Federico & Sciortino, Caterina, 2024. "A Digital Platform Strategy to Improve Food Waste Disposal Practices: Exploring the Case of "Too Good To Go"," Research on World Agricultural Economy, Nan Yang Academy of Sciences Pte Ltd (NASS), vol. 5(1), 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:eee:mateco:v:82:y:2019:i:c:p:272-284. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.