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

Popular matchings with two-sided preferences and one-sided ties

Author

Listed:
  • Agnes Cseh

    (Institute of Economics, Research Centre for Economic and Regional Studies, Hungarian Academy of Sciences, and Corvinus University of Budapest)

  • Chien-Chung Huang

    (Ecole Normale Superieure, Paris, France)

  • Telikepalli Kavitha

    (Tata Institute of Fundamental Research, Mumbai, India)

Abstract

We are given a bipartite graph G = (A[B;E) where each vertex has a preference list ranking its neighbors: in particular, every a 2 A ranks its neighbors in a strict order of preference, whereas the preference list of any b 2 B may contain ties. A matching M is popular if there is no matching M0 such that the number of vertices that prefer M0 to M exceeds the number of vertices that prefer M to M0. We show that the problem of deciding whether G admits a popular matching or not is NP-hard. This is the case even when every b 2 B either has a strict preference list or puts all its neighbors into a single tie. In contrast, we show that the problem becomes polynomially solvable in the case when each b 2 B puts all its neighbors into a single tie. That is, all neighbors of b are tied in b's list and b desires to be matched to any of them. Our main result is an O(n2) algorithm (where n = jA [ Bj) for the popular matching problem in this model. Note that this model is quite di erent from the model where vertices in B have no preferences and do not care whether they are matched or not.

Suggested Citation

  • Agnes Cseh & Chien-Chung Huang & Telikepalli Kavitha, 2017. "Popular matchings with two-sided preferences and one-sided ties," CERS-IE WORKING PAPERS 1723, Institute of Economics, Centre for Economic and Regional Studies.
    • Handle: RePEc:has:discpr:1723
    as

    Download full text from publisher

    File URL: http://econ.core.hu/file/download/mtdp/MTDP1723.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Eric McDermid & Robert W. Irving, 2011. "Popular matchings: structure and algorithms," Journal of Combinatorial Optimization, Springer, vol. 22(3), pages 339-358, October.
    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. Aleksei Yu. Kondratev & Alexander S. Nesterov, 2018. "Random Paths to Popularity in Two-Sided Matching," HSE Working papers WP BRP 195/EC/2018, National Research University Higher School of Economics.
    2. Kondratev, Aleksei Y. & Nesterov, Alexander S., 2022. "Minimal envy and popular matchings," European Journal of Operational Research, Elsevier, vol. 296(3), pages 776-787.
    3. Agnes Cseh & Yuri Faenza & Telikepalli Kavitha & Vladlena Powers, 2020. "Understanding popular matchings via stable matchings," CERS-IE WORKING PAPERS 2003, Institute of Economics, Centre for Economic and Regional Studies.

    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 & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    2. Telikepalli Kavitha & Meghana Nasre & Prajakta Nimbhorkar, 2014. "Popularity at minimum cost," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 574-596, April.
    3. Naoyuki Kamiyama, 2016. "The popular matching and condensation problems under matroid constraints," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1305-1326, November.
    4. Agnes Cseh & Telikepalli Kavitha, 2017. "Popular Edges and Dominant Matchings," CERS-IE WORKING PAPERS 1725, Institute of Economics, Centre for Economic and Regional Studies.
    5. Kondratev, Aleksei Y. & Nesterov, Alexander S., 2022. "Minimal envy and popular matchings," European Journal of Operational Research, Elsevier, vol. 296(3), pages 776-787.
    6. Aleksei Yu. Kondratev & Alexander S. Nesterov, 2018. "Random Paths to Popularity in Two-Sided Matching," HSE Working papers WP BRP 195/EC/2018, National Research University Higher School of Economics.

    More about this item

    Keywords

    popular matching; NP-complete; polynomial algorithm; ties;
    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:1723. 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.