IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v29y2001i4p555-569.html
   My bibliography  Save this article

Stable outcomes of the roommate game with transferable utility

Author

Listed:
  • Johan Karlander

    (Nada, KTH, SE-100 44 Stockholm, Sweden)

  • Kimmo Eriksson

    (IMa, MdH, Box 883, SE-721 23 Västerås, Sweden)

Abstract

We consider the TU version of Gale and Shapley's roommate game. We find several results that are analogous to known results for the NTU game, such as a characterization of stable outcomes by forbidden minors, a characterization of the extreme points of the core, and a median property of stable outcomes. The TU roommate game is a special case of the TU partitioning game of Kaneko and Wooders. Bondareva and Shapley's balancedness condition for the core of such games is the starting point for our forbidden minors approach.

Suggested Citation

  • Johan Karlander & Kimmo Eriksson, 2001. "Stable outcomes of the roommate game with transferable utility," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(4), pages 555-569.
    • Handle: RePEc:spr:jogath:v:29:y:2001:i:4:p:555-569
    Note: Received: April 1999/Revised version: November 2000
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00182/papers/1029004/10290555.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," CERS-IE WORKING PAPERS 1211, Institute of Economics, Centre for Economic and Regional Studies.
    2. Vijay V. Vazirani, 2022. "New Characterizations of Core Imputations of Matching and $b$-Matching Games," Papers 2202.00619, arXiv.org, revised Dec 2022.
    3. Talman, Dolf & Yang, Zaifu, 2011. "A model of partnership formation," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 206-212, March.
    4. Walter Kern & Daniël Paulusma, 2003. "Matching Games: The Least Core and the Nucleolus," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 294-308, May.
    5. Bettina Klaus & Alexandru Nichifor, 2010. "Consistency in one-sided assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 35(3), pages 415-433, September.
    6. Pierre-André Chiappori & Alfred Galichon & Bernard Salanié, 2019. "On Human Capital and Team Stability," Journal of Human Capital, University of Chicago Press, vol. 13(2), pages 236-259.
    7. Biró, Péter & Kern, Walter & Paulusma, Daniël & Wojuteczky, Péter, 2018. "The stable fixtures problem with payments," Games and Economic Behavior, Elsevier, vol. 108(C), pages 245-268.
    8. Vijay V. Vazirani, 2022. "Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids," Papers 2209.04903, arXiv.org, revised Nov 2022.
    9. Péter Biró & Walter Kern & Daniël Paulusma, 2012. "Computing solutions for matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
    10. Andersson, Tommy & Gudmundsson, Jens & Talman, Dolf & Yang, Zaifu, 2014. "A competitive partnership formation process," Games and Economic Behavior, Elsevier, vol. 86(C), pages 165-177.
    11. Akiyoshi Shioura, 2017. "On the Partnership formation problem," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 105-140, December.
    12. Han Xiao & Qizhi Fang, 2022. "Population monotonicity in matching games," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 699-709, May.
    13. Gudmundsson, Jens, 2013. "Cycles and Third-Party Payments in the Partnership Formation Problem," Working Papers 2013:16, Lund University, Department of Economics.
    14. Pierre-Andr'e Chiappori & Alfred Galichon & Bernard Salani'e, 2021. "On Human Capital and Team Stability," Papers 2102.06487, arXiv.org.
    15. Pierre-André Chiappori & Alfred Galichon & Bernard Salanié, 2012. "The Roommate Problem is More Stable than You Think," SciencePo Working papers Main hal-03588302, HAL.
    16. Vazirani, Vijay V., 2022. "The general graph matching game: Approximate core," Games and Economic Behavior, Elsevier, vol. 132(C), pages 478-486.
    17. Gudmundsson, Jens, 2011. "On symmetry in the formation of stable partnerships," Working Papers 2011:29, Lund University, Department of Economics.
    18. Vijay V. Vazirani, 2021. "The General Graph Matching Game: Approximate Core," Papers 2101.07390, arXiv.org, revised Jul 2021.
    19. repec:spo:wpmain:info:hdl:2441/3sd5loegec9d3o795888da61tp is not listed on IDEAS
    20. Salmaso, Pietro, 2024. "Welfare maximization in stable sharing services," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    21. repec:hal:spmain:info:hdl:2441/3sd5loegec9d3o795888da61tp is not listed on IDEAS
    22. Vijay V. Vazirani, 2023. "LP-Duality Theory and the Cores of Games," Papers 2302.07627, arXiv.org, revised Mar 2023.
    23. Pierre-André Chiappori & Alfred Galichon & Bernard Salanié, 2012. "The Roommate Problem is More Stable than You Think," Working Papers hal-03588302, HAL.
    24. Ahmet Alkan & Alparslan Tuncay, 2014. "Pairing Games and Markets," Working Papers 2014.48, Fondazione Eni Enrico Mattei.
    25. Nicolò, Antonio & Salmaso, Pietro & Sen, Arunava & Yadav, Sonal, 2023. "Stable sharing," Games and Economic Behavior, Elsevier, vol. 141(C), pages 337-363.

    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:spr:jogath:v:29:y:2001:i:4:p:555-569. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.