IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v144y2024icp300-328.html
   My bibliography  Save this article

Popular matchings with weighted voters

Author

Listed:
  • Heeger, Klaus
  • Cseh, Ágnes

Abstract

We consider a natural generalization of the well-known Popular Matching problem where every vertex has a weight. We call a matching M more popular than matching M′ if the weight of vertices preferring M to M′ is larger than the weight of vertices preferring M′ to M. For this case, we show that it is NP-hard to find a popular matching. Our main result is a polynomial-time algorithm that delivers a popular matching or a proof for its non-existence in instances where all vertices on one side have weight c for some c>3 and all vertices on the other side have weight 1.

Suggested Citation

  • Heeger, Klaus & Cseh, Ágnes, 2024. "Popular matchings with weighted voters," Games and Economic Behavior, Elsevier, vol. 144(C), pages 300-328.
    • Handle: RePEc:eee:gamebe:v:144:y:2024:i:c:p:300-328
    DOI: 10.1016/j.geb.2024.01.015
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Stephen Ansolabehere & James M. Snyder & Aaron B. Strauss & Michael M. Ting, 2005. "Voting Weights and Formateur Advantages in the Formation of Coalition Governments," American Journal of Political Science, John Wiley & Sons, vol. 49(3), pages 550-563, July.
    2. Eric McDermid & Robert W. Irving, 2011. "Popular matchings: structure and algorithms," Journal of Combinatorial Optimization, Springer, vol. 22(3), pages 339-358, October.
    3. Afacan, Mustafa Oğuz & Bó, Inácio, 2022. "Strategy-proof popular mechanisms," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    4. Darmann, Andreas, 2018. "A social choice approach to ordinal group activity selection," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 57-66.
    5. Chien-Chung Huang & Telikepalli Kavitha, 2021. "Popularity, Mixed Matchings, and Self-Duality," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 405-427, May.
    6. Hatfield, John William & Kojima, Fuhito, 2009. "Group incentive compatibility for matching with contracts," Games and Economic Behavior, Elsevier, vol. 67(2), pages 745-749, November.
    7. Mourad Baïou & Michel Balinski, 2002. "The Stable Allocation (or Ordinal Transportation) Problem," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 485-503, August.
    8. Mourad Baïou & Michel Balinski, 2002. "Erratum: The Stable Allocation (or Ordinal Transportation) Problem," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 662-680, November.
    9. Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, 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. Michael Greinecker & Christopher Kah, 2018. "Pairwise stable matching in large economies," Graz Economics Papers 2018-01, University of Graz, Department of Economics.
    2. Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
    3. Michel Balinski, 2007. "Equitable representation and recruitment," Annals of Operations Research, Springer, vol. 149(1), pages 27-36, February.
    4. Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.
    5. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    6. Bando, Keisuke, 2014. "On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm," Games and Economic Behavior, Elsevier, vol. 87(C), pages 269-287.
    7. Leduc, Matt V. & Thurner, Stefan, 2017. "Incentivizing resilience in financial networks," Journal of Economic Dynamics and Control, Elsevier, vol. 82(C), pages 44-66.
    8. Toyotaka Sakai, 2011. "A note on strategy-proofness from the doctor side in matching with contracts," Review of Economic Design, Springer;Society for Economic Design, vol. 15(4), pages 337-342, December.
    9. Michael Greinecker & Christopher Kah, 2018. "Pairwise stable matching in large economies," Working Papers 2018-02, Faculty of Economics and Statistics, Universität Innsbruck.
    10. Manjunath, Vikram, 2016. "Fractional matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 321-336.
    11. Michael Greinecker & Christopher Kah, 2021. "Pairwise Stable Matching in Large Economies," Econometrica, Econometric Society, vol. 89(6), pages 2929-2974, November.
    12. Kasuya, Yusuke, 2021. "Group incentive compatibility and welfare for matching with contracts," Economics Letters, Elsevier, vol. 202(C).
    13. Ágnes Cseh & Brian C. Dean, 2016. "Improved algorithmic results for unsplittable stable allocation problems," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 657-671, October.
    14. Iwase, Yusuke & Tsuruta, Shoya & Yoshimura, Akina, 2022. "Nash implementation on the basis of general priorities," Games and Economic Behavior, Elsevier, vol. 132(C), pages 368-379.
    15. Chao Huang, 2023. "Concave many-to-one matching," Papers 2309.04181, arXiv.org.
    16. Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.
    17. Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
    18. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
    19. Alexander Westkamp, 2013. "An analysis of the German university admissions system," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(3), pages 561-589, August.
    20. Ning Chen & Nick Gravin & Pinyan Lu, 2014. "Truthful Generalized Assignments via Stable Matching," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 722-736, August.

    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:gamebe:v:144:y:2024:i:c:p:300-328. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.