IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/68df1061-50bc-43bf-b79c-aed6dcd9ab3b.html
   My bibliography  Save this paper

Simple Combinatorial Optimisation Cost Games

Author

Listed:
  • van Velzen, S.

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • van Velzen, S., 2005. "Simple Combinatorial Optimisation Cost Games," Other publications TiSEM 68df1061-50bc-43bf-b79c-a, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:68df1061-50bc-43bf-b79c-aed6dcd9ab3b
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/776501/118.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Xiaotie Deng & Toshihide Ibaraki & Hiroshi Nagamochi, 1999. "Algorithmic Aspects of the Core of Combinatorial Optimization Games," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 751-766, August.
    2. van Velzen, Bas & Hamers, Herbert & Solymosi, Tamas, 2008. "Core stability in chain-component additive games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 116-139, January.
    3. T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 177-185.
    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. Gabrielle Demange & Xiaotie Deng, 2010. "Universally Balanced Combinatorial Optimization Games," Games, MDPI, vol. 1(3), pages 1-18, September.

    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. van Velzen, S., 2005. "Simple Combinatorial Optimisation Cost Games," Discussion Paper 2005-118, Tilburg University, Center for Economic Research.
    2. Sylvain Béal & Eric Rémila & Philippe Solal, 2013. "Accessibility and stability of the coalition structure core," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 187-202, October.
    3. Ata Atay & Marina Núñez, 2019. "Multi-sided assignment games on m-partite graphs," Annals of Operations Research, Springer, vol. 279(1), pages 271-290, August.
    4. Shellshear, Evan & Sudhölter, Peter, 2009. "On core stability, vital coalitions, and extendability," Games and Economic Behavior, Elsevier, vol. 67(2), pages 633-644, November.
    5. Thomas Bietenhader & Yoshio Okamoto, 2006. "Core Stability of Minimum Coloring Games," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 418-431, May.
    6. 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.
    7. Han Xiao & Qizhi Fang, 2022. "Population monotonicity in matching games," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 699-709, May.
    8. Nunez, Marina & Rafels, Carles, 2003. "Characterization of the extreme core allocations of the assignment game," Games and Economic Behavior, Elsevier, vol. 44(2), pages 311-331, August.
    9. Raïssa-Juvette Samba Zitou & Rhonya Adli, 2012. "Quasi stable outcomes in the assignment game," Theory and Decision, Springer, vol. 72(3), pages 323-340, March.
    10. Atay, Ata & Núñez, Marina, 2019. "A note on the relationship between the core and stable sets in three-sided markets," Mathematical Social Sciences, Elsevier, vol. 98(C), pages 10-14.
    11. Dezső Bednay, 2014. "Stable sets in one-seller assignment games," Annals of Operations Research, Springer, vol. 222(1), pages 143-152, November.
    12. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.
    13. Vasily V. Gusev, 2021. "Set-weighted games and their application to the cover problem," HSE Working papers WP BRP 247/EC/2021, National Research University Higher School of Economics.
    14. Oriol Tejada, 2013. "Analysis of the core of multisided Böhm-Bawerk assignment markets," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 189-205, April.
    15. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "Three-valued simple games," Theory and Decision, Springer, vol. 85(2), pages 201-224, August.
    16. Hideto Koizumi, 2023. "The enemy of my enemy is my friend: new conditions for network games," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 11(2), pages 223-233, October.
    17. Dylan Laplace Mermoud, 2023. "Geometry of Set Functions in Game Theory: Combinatorial and Computational Aspects," Papers 2301.02950, arXiv.org, revised Oct 2023.
    18. Tamás Solymosi, 2024. "Assignment games with population monotonic allocation schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 62(1), pages 67-88, February.
    19. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Other publications TiSEM efae8d09-83e6-4fe4-9623-e, Tilburg University, School of Economics and Management.
    20. P.Delle Site & André de Palma & Samarth Ghoslya, 2024. "Matching and fair pricing of socially optimal, stable and financially sustainable ride-sharing in congestible networks," THEMA Working Papers 2024-06, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.

    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:tiu:tiutis:68df1061-50bc-43bf-b79c-aed6dcd9ab3b. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.