IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v52y2006i1p77-87.html
   My bibliography  Save this article

Three-dimensional stable matching with cyclic preferences

Author

Listed:
  • Eriksson, Kimmo
  • Sjostrand, Jonas
  • Strimling, Pontus

Abstract

No abstract is available for this item.

Suggested Citation

  • Eriksson, Kimmo & Sjostrand, Jonas & Strimling, Pontus, 2006. "Three-dimensional stable matching with cyclic preferences," Mathematical Social Sciences, Elsevier, vol. 52(1), pages 77-87, July.
  • Handle: RePEc:eee:matsoc:v:52:y:2006:i:1:p:77-87
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(06)00025-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Alkan, Ahmet, 1988. "Nonexistence of stable threesome matchings," Mathematical Social Sciences, Elsevier, vol. 16(2), pages 207-209, October.
    2. Boros, Endre & Gurvich, Vladimir, 2000. "Stable effectivity functions and perfect graphs," Mathematical Social Sciences, Elsevier, vol. 39(2), pages 175-194, March.
    3. Danilov, V. I., 2003. "Existence of stable matchings in some three-sided systems," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 145-148, 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. Feng Zhang & Liwei Zhong, 2021. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 928-936, November.
    2. Jorge Arenas & Juan Pablo Torres-Martínez, 2023. "Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-8, March.
    3. Feng Zhang & Liwei Zhong, 0. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-9.
    4. Jorge Arenas & Juan Pablo Torres-Martinez, 2024. "On Incentives in Three-Sided Markets," Working Papers wp558, University of Chile, Department of Economics.
    5. Combe, Julien, 2022. "Matching with ownership," Journal of Mathematical Economics, Elsevier, vol. 98(C).
    6. Hofbauer, Johannes, 2016. "d-dimensional stable matching with cyclic preferences," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 72-76.
    7. Liwei Zhong & Yanqin Bai, 2019. "Three-sided stable matching problem with two of them as cooperative partners," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 286-292, January.

    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. Somdeb Lahiri, 2004. "Pair-wise envy free and stable matchings for two sided systems with techniques," Economics Bulletin, AccessEcon, vol. 3(15), pages 1-9.
    2. repec:ebl:ecbull:v:3:y:2004:i:15:p:1-9 is not listed on IDEAS
    3. Combe, Julien, 2022. "Matching with ownership," Journal of Mathematical Economics, Elsevier, vol. 98(C).
    4. Jorge Arenas & Juan Pablo Torres-Martinez, 2024. "On Incentives in Three-Sided Markets," Working Papers wp558, University of Chile, Department of Economics.
    5. Somdeb Lahiri, 2007. "Core and equilibria in an assembled product industry," Review of Economic Design, Springer;Society for Economic Design, vol. 10(4), pages 327-339, March.
    6. Papai, Szilvia, 2004. "Unique stability in simple coalition formation games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 337-354, August.
    7. Joseph Abdou, 2012. "The structure of unstable power mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 50(2), pages 389-415, June.
    8. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    9. Koji Takamiya & Akira Tanaka, 2016. "Computational complexity in the design of voting rules," Theory and Decision, Springer, vol. 80(1), pages 33-41, January.
    10. Koji Takamiya & Akira Tanaka, 2006. "Computational Complexity in the Design of Voting Rules," ISER Discussion Paper 0653, Institute of Social and Economic Research, Osaka University, revised Jul 2006.
    11. Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
    12. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
    13. Gersbach, Hans & Haller, Hans, 2019. "Households, markets and public choice," Mathematical Social Sciences, Elsevier, vol. 100(C), pages 16-28.
    14. Federico Echenique & Joseph Root & Fedor Sandomirskiy, 2024. "Stable matching as transportation," Papers 2402.13378, arXiv.org.
    15. Lahiri, Somdeb, 2007. "A weak bargaining set for contract choice problems," Research in Economics, Elsevier, vol. 61(4), pages 185-190, December.
    16. Jorge Arenas & Juan Pablo Torres-Martínez, 2023. "Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-8, March.
    17. Danilov, V. I., 2003. "Existence of stable matchings in some three-sided systems," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 145-148, October.
    18. Bloch, Francis & Cantala, David & Gibaja, Damián, 2020. "Matching through institutions," Games and Economic Behavior, Elsevier, vol. 121(C), pages 204-231.
    19. Hans Gersbach & Hans Haller, 2011. "Bargaining cum voice," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(2), pages 199-225, February.
    20. Inés Macho-Stadler & David Pérez-Castrillo, 2021. "Agency theory meets matching theory," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 1-33, March.
    21. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.

    More about this item

    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:eee:matsoc:v:52:y:2006:i:1:p:77-87. 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/505565 .

    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.