IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2610.23282.html

A Characterization of Quantile Stable Matchings in Many-to-Many Markets

Author

Listed:
  • Paola Manasero
  • Pablo Neme

Abstract

We study two-sided many-to-many matching markets where agents' preferences satisfy strong substitutability and the law of aggregate demand (LAD). In this framework, the set of stable matchings forms a finite distributive lattice, and quantile stable matchings exist and satisfy the polarization of interests. Building on the cycle-reduction machinery of Bonifacio et al. (2022), we provide a purely combinatorial characterization of quantile stable matchings formulated in terms of preference cycles and their induced precedence order. Specifically, we define an order-theoretic counting function on cycles and prove that each quantile stable matching corresponds to the elimination of an endogenously determined closed set of cycles starting from the firm-optimal stable matching. This characterization extends the rotation-based framework of Cheng (2008) from one-to-one markets to many-to-many markets and bypasses the need for exhaustive outcome enumeration or partner sorting across the entire stable set.

Suggested Citation

  • Paola Manasero & Pablo Neme, 2026. "A Characterization of Quantile Stable Matchings in Many-to-Many Markets," Papers 2610.23282, arXiv.org.
    • Handle: RePEc:arx:papers:2610.23282
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2610.23282
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2610.23282. 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.