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

Efficiency in the Roommates Problem

Author

Listed:
  • Keita Kuwahara

Abstract

We propose an $O(n^2)$-time algorithm to determine whether a given matching is efficient in the roommates problem.

Suggested Citation

  • Keita Kuwahara, 2025. "Efficiency in the Roommates Problem," Papers 2502.16960, arXiv.org, revised Mar 2025.
    • Handle: RePEc:arx:papers:2502.16960
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Morrill, Thayer, 2010. "The roommates problem revisited," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1739-1756, September.
    2. Aziz, Haris & Brandt, Felix & Harrenstein, Paul, 2013. "Pareto optimality in coalition formation," Games and Economic Behavior, Elsevier, vol. 82(C), pages 562-581.
    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. Combe, Julien, 2022. "Matching with ownership," Journal of Mathematical Economics, Elsevier, vol. 98(C).
    2. Niclas Boehmer & Edith Elkind, 2020. "Stable Roommate Problem with Diversity Preferences," Papers 2004.14640, arXiv.org.
    3. Andreas Darmann, 2018. "Stable and Pareto optimal group activity selection from ordinal preferences," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(4), pages 1183-1209, November.
    4. Agnes Cseh & Tamas Fleiner & Petra Harjan, 2020. "Pareto optimal coalitions of fixed size," CERS-IE WORKING PAPERS 2005, Institute of Economics, Centre for Economic and Regional Studies.
    5. Azar Abizada, 2019. "Exchange-stability in roommate problems," Review of Economic Design, Springer;Society for Economic Design, vol. 23(1), pages 3-12, June.
    6. Aziz, Haris & Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2017. "Computational aspects of assigning agents to a line," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 93-99.
    7. Martin Gairing & Rahul Savani, 2019. "Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1101-1121, August.
    8. Aziz, Haris & Brandt, Felix & Harrenstein, Paul, 2013. "Pareto optimality in coalition formation," Games and Economic Behavior, Elsevier, vol. 82(C), pages 562-581.
    9. Hakan İnal, 2014. "A Generalization of the Lone Wolf Theorem," Metroeconomica, Wiley Blackwell, vol. 65(4), pages 541-547, November.
    10. repec:ehu:ikerla:13424 is not listed on IDEAS
    11. Andreas Darmann & Edith Elkind & Sascha Kurz & Jérôme Lang & Joachim Schauer & Gerhard Woeginger, 2018. "Group activity selection problem with approval preferences," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 767-796, September.
    12. Aziz, Haris & Brandl, Florian & Brandt, Felix, 2015. "Universal Pareto dominance and welfare for plausible utility functions," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 123-133.
    13. Kong, Qianqian & Peters, Hans, 2023. "Power indices for networks, with applications to matching markets," European Journal of Operational Research, Elsevier, vol. 306(1), pages 448-456.
    14. Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
    15. Ágnes Cseh & Tamás Fleiner & Petra Harján, 2019. "Pareto Optimal Coalitions of Fixed Size," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 4(1), pages 87-108, November.
    16. Vittorio Bilò & Angelo Fanelli & Michele Flammini & Gianpiero Monaco & Luca Moscardelli, 2018. "Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation," Post-Print hal-02089363, HAL.
    17. Greg Leo & Yevgeniy Vorobeychik & Myrna Wooders, 2023. "Subgame Perfect Coalition Formation," Dynamic Games and Applications, Springer, vol. 13(2), pages 510-524, June.
    18. Kondor, Gábor, 2022. "Egyoldali párosítási piacok nehézségi eredményei magasabb dimenzióban [Hardness results of one-sided matching markets in higher dimensions]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 825-840.
    19. Wouter Vergote, 2019. "Revisiting stability in one-to-one matching problems," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(1), pages 59-75, May.
    20. Justin Burkett & Francis X. Flanagan & Amanda L. Griffith, 2018. "Allocating group housing," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(4), pages 581-596, April.
    21. Peter Biro & Elena Iñarra & Elena Molis, 2014. "A new solution for the roommate problem. The Q-stable matchings," ThE Papers 14/04, Department of Economic Theory and Economic History of the University of Granada..

    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:2502.16960. 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.