Cost allocation for set covering: The happy nucleolus

被引:0
|
作者
Blauth, Jannis [1 ]
Ellerbrock, Antonia [1 ]
Traub, Vera [1 ]
Vygen, Jens [1 ]
机构
[1] Univ Bonn, Res Inst Discrete Math, Bonn, Germany
关键词
Cooperative game theory; Cost allocation; Happy nucleolus; Set covering; GAMES; CORE; AXIOMATIZATION;
D O I
10.1016/j.orl.2024.107158
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider cost allocation for set covering problems. We allocate as much cost to the elements (players) as possible without violating the group rationality condition, and so that the excess vector is lexicographically maximized. This happy nucleolus has several nice properties. In particular, we show that it can be computed considering a small subset of "simple" coalitions only. While computing the nucleolus for set covering is NP-hard, our results imply that the happy nucleolus can be computed in polynomial time. (c) 2024 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons .org /licenses /by-nc -nd /4 .0/).
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Nucleolus based cost allocation methods for a class of constrained lane covering games
    Oner, Nihat
    Kuyzu, Gultekin
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 172
  • [2] A Cost-Based Set-Covering Location-Allocation Problem with Unknown Covering Radius
    Bashiri, Mahdi
    Fotuhi, Fateme
    2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 1979 - 1983
  • [3] Threshold based discounting networks: The cost allocation provided by the nucleolus
    Skorin-Kapov, D
    Skorin-Kapov, J
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 166 (01) : 154 - 159
  • [4] Core and nucleolus of covering games
    Preux, N
    Bendali, F
    Mailfert, J
    Quilliot, A
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2000, 34 (03): : 363 - 383
  • [5] A novel nucleolus allocation of fixed transmission cost for various transaction modes
    Gao, X.
    Peng, J. C.
    Luo, A.
    2006 INTERNATIONAL CONFERENCE ON POWER SYSTEMS TECHNOLOGY: POWERCON, VOLS 1- 6, 2006, : 1550 - +
  • [6] Evolutionary algorithms for multiple allocation hub set covering problem
    Weng, Kerui
    Wang, Yijuan
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2, 2008, : 408 - +
  • [7] On the minimum-cost set-covering problem
    Chiang, CC
    Dai, HK
    PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3, 2005, : 1199 - 1205
  • [8] A nucleolus solution for fixed transmission cost allocation under hybrid transactions modes
    College of Electrical and Information Engineering, Hunan University, Changsha 410082, China
    Zhongguo Dianji Gongcheng Xuebao, 2007, 10 (120-124):
  • [9] Research of the maintenance cost allocation of secondary electrical equipment based on nucleolus solution
    Yang, L.
    Ying, L. M.
    Wang, Y. L.
    Wang, J. W.
    Jia, Y. T.
    ENERGY SCIENCE AND APPLIED TECHNOLOGY (ESAT 2016), 2016, : 351 - 356
  • [10] ON A COST ALLOCATION PROBLEM ARISING FROM A CAPACITATED CONCENTRATOR COVERING PROBLEM
    SKORINKAPOV, D
    OPERATIONS RESEARCH LETTERS, 1993, 13 (05) : 315 - 323