IDEAS home Printed from https://ideas.repec.org/p/has/discpr/2004.html
   My bibliography  Save this paper

Popular Matchings in Complete Graphs

Author

Listed:
  • Agnes Cseh

    (Centre for Economic and Regional Studies, Institute of Economics)

  • Telikepalli Kavitha

    (Tata Institute of Fundamental Research, Mumbai, India)

Abstract

Our input is a complete graph G on n vertices where each vertex has a strictranking of all other vertices in G. The goal is to construct a matching in G that is “globallystable” or popular. A matching M is popular if M does not lose a head-to-head election againstany matching M’: here each vertex casts a vote forthe matching in {M,M’} in which it gets abetter assignment. Popular matchings need not exist in the given instance G and the popularmatching problem is to decide whether one exists or not. The popular matching problem in Gis easy to solve for odd n. Surprisingly, the problem becomes NP-hard for even n, as we showhere. This seems to be the first graph theoretic problem that is efficiently solvable when n hasone parity and NP-hard when n has the other parity.

Suggested Citation

  • Agnes Cseh & Telikepalli Kavitha, 2020. "Popular Matchings in Complete Graphs," CERS-IE WORKING PAPERS 2004, Institute of Economics, Centre for Economic and Regional Studies.
    • Handle: RePEc:has:discpr:2004
    as

    Download full text from publisher

    File URL: https://www.mtakti.hu/wp-content/uploads/2020/01/CERSIEWP202004.pdf
    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. Chung-Piaw Teo & Jay Sethuraman, 1998. "The Geometry of Fractional Stable Matchings and Its Applications," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 874-891, November.
    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. Bettina Klaus & Flip Klijn, 2010. "Smith and Rawls share a room: stability and medians," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 35(4), pages 647-667, October.
    2. Jens Gudmundsson, 2019. "Compromises and Rewards: stable and non-manipulable probabilistic matching," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(2), pages 365-392, June.
    3. Bettina Klaus & Flip Klijn, 2007. "Smith and Rawls Share a Room," Working Papers 315, Barcelona School of Economics.
    4. Piotr Dworczak, 2021. "Deferred Acceptance with Compensation Chains," Operations Research, INFORMS, vol. 69(2), pages 456-468, March.
    5. Burak Can & Bettina Klaus, 2013. "Consistency and population sensitivity properties in marriage and roommate markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(4), pages 835-862, October.
    6. Chen, Peter & Egesdal, Michael & Pycia, Marek & Yenmez, M. Bumin, 2016. "Median stable matchings in two-sided markets," Games and Economic Behavior, Elsevier, vol. 97(C), pages 64-69.
    7. Fleiner, Tamas, 2003. "On the stable b-matching polytope," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 149-158, October.
    8. 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.
    9. Gudmundsson, Jens, 2013. "Cycles and Third-Party Payments in the Partnership Formation Problem," Working Papers 2013:16, Lund University, Department of Economics.
    10. Vijay V. Vazirani, 2024. "The Assignment Game: New Mechanisms for Equitable Core Imputations," Papers 2402.11437, arXiv.org.
    11. James Boudreau & Vicki Knoblauch, 2013. "Preferences and the price of stability in matching markets," Theory and Decision, Springer, vol. 74(4), pages 565-589, April.
    12. Federico Echenique & SangMok Lee & Matthew Shum & M. Bumin Yenmez, 2021. "Stability and Median Rationalizability for Aggregate Matchings," Games, MDPI, vol. 12(2), pages 1-15, April.
    13. Azar Abizada, 2019. "Exchange-stability in roommate problems," Review of Economic Design, Springer;Society for Economic Design, vol. 23(1), pages 3-12, June.
    14. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    15. Gilles, R.P. & Lazarova, E.A. & Ruys, P.H.M., 2006. "Stability, Specialization and Social Recognition," Other publications TiSEM 7fa36115-a85c-44d2-ad23-0, Tilburg University, School of Economics and Management.
    16. Pierre-André Chiappori & Alfred Galichon & Bernard Salanié, 2012. "The Roommate Problem is More Stable than You Think," Working Papers hal-03588302, HAL.
    17. 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.
    18. Iñarra, E. & Larrea, C. & Molis, E., 2013. "Absorbing sets in roommate problems," Games and Economic Behavior, Elsevier, vol. 81(C), pages 165-178.
    19. Özkal-Sanver, Ipek, 2010. "Impossibilities for roommate problems," Mathematical Social Sciences, Elsevier, vol. 59(3), pages 360-363, May.
    20. Bettina Klaus & Flip Klijn, 2006. "Median Stable Matching for College Admissions," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 1-11, April.

    More about this item

    Keywords

    popularmatching; NP-completeness; polynomial algorithm; stable matching;
    All these keywords.

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    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:has:discpr:2004. 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: Nora Horvath (email available below). General contact details of provider: https://edirc.repec.org/data/iehashu.html .

    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.