IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2310.18736.html
   My bibliography  Save this paper

A Gale-Shapley View of Unique Stable Marriages

Author

Listed:
  • Kartik Gokhale
  • Amit Kumar Mallik
  • Ankit Kumar Misra
  • Swaprava Nath

Abstract

Stable marriage of a two-sided market with unit demand is a classic problem that arises in many real-world scenarios. In addition, a unique stable marriage in this market simplifies a host of downstream desiderata. In this paper, we explore a new set of sufficient conditions for unique stable matching (USM) under this setup. Unlike other approaches that also address this question using the structure of preference profiles, we use an algorithmic viewpoint and investigate if this question can be answered using the lens of the deferred acceptance (DA) algorithm (Gale and Shapley, 1962). Our results yield a set of sufficient conditions for USM (viz., MaxProp and MaxRou) and show that these are disjoint from the previously known sufficiency conditions like sequential preference and no crossing. We also provide a characterization of MaxProp that makes it efficiently verifiable, and shows the gap between MaxProp and the entire USM class. These results give a more detailed view of the sub-structures of the USM class.

Suggested Citation

  • Kartik Gokhale & Amit Kumar Mallik & Ankit Kumar Misra & Swaprava Nath, 2023. "A Gale-Shapley View of Unique Stable Marriages," Papers 2310.18736, arXiv.org, revised Aug 2024.
    • Handle: RePEc:arx:papers:2310.18736
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Chung, Kim-Sau, 2000. "On the Existence of Stable Roommate Matchings," Games and Economic Behavior, Elsevier, vol. 33(2), pages 206-230, November.
    2. José Alcalde, 1994. "Exchange-proofness or divorce-proofness? Stability in one-sided matching markets," Review of Economic Design, Springer;Society for Economic Design, vol. 1(1), pages 275-287, December.
    Full references (including those not matched with items on IDEAS)

    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. Azar Abizada, 2019. "Exchange-stability in roommate problems," Review of Economic Design, Springer;Society for Economic Design, vol. 23(1), pages 3-12, June.
    2. Papai, Szilvia, 2004. "Unique stability in simple coalition formation games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 337-354, August.
    3. Paula Jaramillo & Ça?atay Kayi & Flip Klijn, 2017. "Rank Gaps and the Size of the Core for Roommate Problems," Documentos de Trabajo 15499, Universidad del Rosario.
    4. José Luis Contreras & Juan Pablo Torres-Martínez, 2021. "The roommate problem with externalities," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 149-165, March.
    5. Jens Gudmundsson, 2014. "When do stable roommate matchings exist? A review," Review of Economic Design, Springer;Society for Economic Design, vol. 18(2), pages 151-161, June.
    6. MAULEON, Ana & MOLIS, Elena & VANNETELBOSCH, Vincent & VERGOTE, Wouter, 2011. "Absolutely stable roommate problems," LIDAM Discussion Papers CORE 2011029, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2019. "The core of roommate problems: size and rank-fairness within matched pairs," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(1), pages 157-179, March.
    8. Niclas Boehmer & Edith Elkind, 2020. "Stable Roommate Problem with Diversity Preferences," Papers 2004.14640, arXiv.org.
    9. Ana Mauleon & Elena Molis & Vincent Vannetelbosch & Wouter Vergote, 2014. "Dominance invariant one-to-one matching problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 925-943, November.
    10. Gutin, Gregory Z. & Neary, Philip R. & Yeo, Anders, 2023. "Unique stable matchings," Games and Economic Behavior, Elsevier, vol. 141(C), pages 529-547.
    11. Zuckerman, David, 2024. "Multidimensional homophily," Journal of Economic Behavior & Organization, Elsevier, vol. 218(C), pages 486-513.
    12. Jaeok Park, 2017. "Competitive equilibrium and singleton cores in generalized matching problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(2), pages 487-509, May.
    13. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    14. Gudmundsson, Jens, 2013. "Cycles and Third-Party Payments in the Partnership Formation Problem," Working Papers 2013:16, Lund University, Department of Economics.
    15. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    16. Emiliya Lazarova & Dinko Dimitrov, 2017. "Paths to stability in two-sided matching under uncertainty," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 29-49, March.
    17. Özkal-Sanver, Ipek, 2010. "Impossibilities for roommate problems," Mathematical Social Sciences, Elsevier, vol. 59(3), pages 360-363, May.
    18. Bettina Klaus & Flip Klijn & Markus Walzl, 2007. "The Evolution of Roommate Networks: A Comment on Jackson and Watts JET (2002)," UFAE and IAE Working Papers 694.07, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    19. Hugo Gimbert & Claire Mathieu & Simon Mauras, 2021. "Constrained School Choice with Incomplete Information," Papers 2109.09089, arXiv.org.
    20. Salonen, Hannu & Salonen, Mikko A.A., 2018. "Mutually best matches," Mathematical Social Sciences, Elsevier, vol. 91(C), pages 42-50.

    More about this item

    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:2310.18736. 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: arXiv administrators (email available below). General contact details of provider: http://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.