IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v10y2005i4d10.1007_s10878-005-4920-8.html
   My bibliography  Save this article

A Note on Balancedness of Dominating Set Games

Author

Listed:
  • Qizhi Fang

    (Ocean University of China)

  • Hye Kyung Kim

    (Catholic University of Daegu)

Abstract

In this paper we consider the balancedness of dominating set games, introduced by Velzen 2003. We establish a new kind of 0-1 program formulation to model the domination problem on graphs, and give a strong connection between LP relaxation of this 0-1 program and the cost allocation problem concerning the core of a dominating set game. Duality theory on Lagrange dual is the main technique in our proof. In particular, we use this insight to give the equivalence of the balancedness for two different dominating set games.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:4:d:10.1007_s10878-005-4920-8
    DOI: 10.1007/s10878-005-4920-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-4920-8
    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-005-4920-8?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. Daniel Granot, 1984. "A Note on the Room-Mates Problem and a Related Revenue Allocation Problem," Management Science, INFORMS, vol. 30(5), pages 633-643, May.
    2. GOEMANS, Michel X. & SKUTELLA, Martin, 2000. "Cooperative facility location games," LIDAM Discussion Papers CORE 2000014, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. 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.
    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. Lindong Liu & Xiangtong Qi & Zhou Xu, 2016. "Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 687-702, November.
    2. Han Xiao & Tianhang Lu & Qizhi Fang, 2021. "Approximate Core Allocations for Multiple Partners Matching Games," Papers 2107.01442, arXiv.org, revised Oct 2021.
    3. 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.
    4. 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.
    5. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "Three-valued simple games," Theory and Decision, Springer, vol. 85(2), pages 201-224, August.
    6. 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.
    7. 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.
    8. 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.
    9. Nils Bertschinger & Martin Hoefer & Daniel Schmand, 2019. "Flow Allocation Games," Papers 1908.01714, arXiv.org, revised Dec 2023.
    10. Lotty E. Westerink‐Duijzer & Loe P. J. Schlicher & Marieke Musegaas, 2020. "Core Allocations for Cooperation Problems in Vaccination," Production and Operations Management, Production and Operations Management Society, vol. 29(7), pages 1720-1737, July.
    11. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    12. Lindong Liu & Yuqian Zhou & Zikang Li, 2022. "Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(1), pages 81-99, February.
    13. Gusev, Vasily V., 2023. "Set-weighted games and their application to the cover problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 438-450.
    14. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    15. 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.
    16. Haimanko, Ori & Le Breton, Michel & Weber, Shlomo, 2004. "Voluntary formation of communities for the provision of public projects," Journal of Economic Theory, Elsevier, vol. 115(1), pages 1-34, March.
    17. van Velzen, S., 2003. "Dominating Set Games," Discussion Paper 2003-039, Tilburg University, Center for Economic Research.
    18. van Velzen, S., 2005. "Simple Combinatorial Optimisation Cost Games," Other publications TiSEM 68df1061-50bc-43bf-b79c-a, Tilburg University, School of Economics and Management.
    19. 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.
    20. 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.

    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:10:y:2005:i:4:d:10.1007_s10878-005-4920-8. 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.