IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v26y2013i4d10.1007_s10878-012-9484-9.html
   My bibliography  Save this article

On the cores of games arising from integer edge covering functions of graphs

Author

Listed:
  • Boram Park

    (Rutgers University)

  • Suh-Ryung Kim

    (Seoul National University)

  • Hye Kyung Kim

    (Catholic University of Daegu)

Abstract

In this paper, we study cooperative games arising from integer edge covering problems on graphs. We introduce two games, a rigid k-edge covering game and its relaxed game, as generalizations of a rigid edge covering game and its relaxed game studied by Liu and Fang (2007). Then we give a characterization of the cores of both games, find relationships between them, and give necessary and sufficient conditions for the balancedness of a rigid k-edge covering game and its relaxed game.

Suggested Citation

  • Boram Park & Suh-Ryung Kim & Hye Kyung Kim, 2013. "On the cores of games arising from integer edge covering functions of graphs," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 786-798, November.
  • Handle: RePEc:spr:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-012-9484-9
    DOI: 10.1007/s10878-012-9484-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9484-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-012-9484-9?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. 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. Lloyd S. Shapley, 1967. "On balanced sets and cores," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(4), pages 453-460.
    3. Thomas Bietenhader & Yoshio Okamoto, 2006. "Core Stability of Minimum Coloring Games," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 418-431, May.
    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. Tianhang Lu & Han Xian & Qizhi Fang, 2023. "Approximate Core Allocations for Edge Cover Games," Papers 2308.11222, arXiv.org.

    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. 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.
    2. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Discussion Paper 2011-016, Tilburg University, Center for Economic Research.
    3. M. Musegaas & P. E. M. Borm & M. Quant, 2016. "Simple and three-valued simple minimum coloring games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(2), pages 239-258, October.
    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. Eric Bahel & Christian Trudeau, 2022. "Minimum coloring problems with weakly perfect graphs," Review of Economic Design, Springer;Society for Economic Design, vol. 26(2), pages 211-231, June.
    6. Luis A. Guardiola & Ana Meca & Justo Puerto, 2021. "Enforcing fair cooperation in production-inventory settings with heterogeneous agents," Annals of Operations Research, Springer, vol. 305(1), pages 59-80, October.
    7. Sergei Dotsenko & Vladimir Mazalov, 2021. "A Cooperative Network Packing Game with Simple Paths," Mathematics, MDPI, vol. 9(14), pages 1-18, July.
    8. Gonzalez, Stéphane & Rostom, Fatma Zahra, 2022. "Sharing the global outcomes of finite natural resource exploitation: A dynamic coalitional stability perspective," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 1-10.
    9. Judith Timmer & Werner Scheinhardt, 2018. "Customer and Cost Sharing in a Jackson Network," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 20(03), pages 1-10, September.
    10. Tobias Harks & Martin Hoefer & Anja Schedel & Manuel Surek, 2021. "Efficient Black-Box Reductions for Separable Cost Sharing," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 134-158, February.
    11. Sun, Ning & Trockel, Walter & Yang, Zaifu, 2008. "Competitive outcomes and endogenous coalition formation in an n-person game," Journal of Mathematical Economics, Elsevier, vol. 44(7-8), pages 853-860, July.
    12. Bossert, Walter & Derks, Jean & Peters, Hans, 2005. "Efficiency in uncertain cooperative games," Mathematical Social Sciences, Elsevier, vol. 50(1), pages 12-23, July.
    13. Marco Slikker, 2005. "Balancedness of Sequencing Games with Multiple Parallel Machines," Annals of Operations Research, Springer, vol. 137(1), pages 177-189, July.
    14. Suijs, J.P.M. & De Waegenaere, A.M.B. & Borm, P.E.M., 1996. "Stochastic Cooperative Games in Insurance and Reinsurance," Discussion Paper 1996-53, Tilburg University, Center for Economic Research.
    15. Sylvain Béal & Stéphane Gonzalez & Philippe Solal & Peter Sudhölter, 2023. "Axiomatic characterizations of the core without consistency," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 687-701, September.
    16. Bouchery, Yann & Hezarkhani, Behzad & Stauffer, Gautier, 2022. "Coalition formation and cost sharing for truck platooning," Transportation Research Part B: Methodological, Elsevier, vol. 165(C), pages 15-34.
    17. van Velzen, S., 2005. "Simple Combinatorial Optimisation Cost Games," Discussion Paper 2005-118, Tilburg University, Center for Economic Research.
    18. Tianhang Lu & Han Xian & Qizhi Fang, 2023. "Approximate Core Allocations for Edge Cover Games," Papers 2308.11222, arXiv.org.
    19. Aymeric Lardon, 2019. "On the coalitional stability of monopoly power in differentiated Bertrand and Cournot oligopolies," Post-Print halshs-02355341, HAL.
    20. Qizhi Fang & Hye Kyung Kim, 2005. "A Note on Balancedness of Dominating Set Games," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 303-310, December.

    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:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-012-9484-9. 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: 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.