IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v207y2025i3d10.1007_s10957-025-02806-1.html
   My bibliography  Save this article

Approximate Cores of Submodular Cost Set Cover Games

Author

Listed:
  • Qingqin Nong

    (Ocean University of China)

  • Jingyu Yao

    (Ocean University of China)

  • Xin Qin

    (Ocean University of China)

  • Suning Gong

    (Qingdao University)

  • Qizhi Fang

    (Ocean University of China)

Abstract

This paper considers approximate cores of submodular cost set cover games. A submodular cost set cover game involves a finite set of players, an index set, and a submodular function defined on the index set. Each element in the index set corresponds to a subset of the player set and the union of all these subsets equals the entire player set. Given a subset of players, call a subset of the index set a cover of it if the union of the corresponding sets contains all the players in the subset. For any subset of players, its cost is the minimum submodular function value over all possible set covers of the subset. In this paper, we study the non-emptiness property of the approximate cores of submodular cost set cover games from the perspective of the integrality gap of the mathematical program for submodular cost set cover optimization problems.

Suggested Citation

  • Qingqin Nong & Jingyu Yao & Xin Qin & Suning Gong & Qizhi Fang, 2025. "Approximate Cores of Submodular Cost Set Cover Games," Journal of Optimization Theory and Applications, Springer, vol. 207(3), pages 1-15, December.
    • Handle: RePEc:spr:joptap:v:207:y:2025:i:3:d:10.1007_s10957-025-02806-1
    DOI: 10.1007/s10957-025-02806-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02806-1
    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/s10957-025-02806-1?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

    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. Ehud Kalai & Eitan Zemel, 1982. "Generalized Network Problems Yielding Totally Balanced Games," Operations Research, INFORMS, vol. 30(5), pages 998-1008, October.
    3. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, December.
    4. Michel Grabisch & Peter Sudhölter, 2020. "Characterization of TU games with stable cores by nested balancedness," Documents de travail du Centre d'Economie de la Sorbonne 20009, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    5. Frenk, J.B.G. & Gromicho, J.A.S. & Zhang, S., 1994. "A deep cut ellipsoid algorithm for convex programming," Econometric Institute Research Papers 11633, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Ehud Kalai & Eitan Zemel, 1982. "Totally Balanced Games and Games of Flow," Mathematics of Operations Research, INFORMS, vol. 7(3), pages 476-478, August.
    7. Vazirani, Vijay V., 2022. "The general graph matching game: Approximate core," Games and Economic Behavior, Elsevier, vol. 132(C), pages 478-486.
    8. Hiroshi Nagamochi & Dao-Zhi Zeng & Naohiśa Kabutoya & Toshihide Ibaraki, 1997. "Complexity of the Minimum Base Game on Matroids," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 146-164, February.
    9. Han Xiao & Tianhang Lu & Qizhi Fang, 2021. "Approximate Core Allocations for Multiple Partners Matching Games," Papers 2107.01442, arXiv.org, revised Oct 2021.
    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. Tianhang Lu & Han Xian & Qizhi Fang, 2023. "Approximate Core Allocations for Edge Cover Games," Papers 2308.11222, arXiv.org.
    2. Vijay V. Vazirani, 2022. "Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids," Papers 2209.04903, arXiv.org, revised Nov 2022.
    3. Vijay V. Vazirani, 2023. "LP-Duality Theory and the Cores of Games," Papers 2302.07627, arXiv.org, revised Mar 2023.
    4. Nils Bertschinger & Martin Hoefer & Daniel Schmand, 2019. "Flow Allocation Games," Papers 1908.01714, arXiv.org, revised Dec 2023.
    5. Bergantiños, Gustavo & Gómez-Rúa, María & Llorca, Natividad & Pulido, Manuel & Sánchez-Soriano, Joaquín, 2020. "Allocating costs in set covering problems," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1074-1087.
    6. Csóka Péter & Pintér Miklós, 2016. "On the Impossibility of Fair Risk Allocation," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 16(1), pages 143-158, January.
    7. Borrero, D.V. & Hinojosa, M.A. & Mármol, A.M., 2016. "DEA production games and Owen allocations," European Journal of Operational Research, Elsevier, vol. 252(3), pages 921-930.
    8. Dylan Laplace Mermoud, 2023. "Geometry of Set Functions in Game Theory: Combinatorial and Computational Aspects," Papers 2301.02950, arXiv.org, revised Oct 2023.
    9. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    10. Demetrescu, Camil & Lupia, Francesco & Mendicelli, Angelo & Ribichini, Andrea & Scarcello, Francesco & Schaerf, Marco, 2019. "On the Shapley value and its application to the Italian VQR research assessment exercise," Journal of Informetrics, Elsevier, vol. 13(1), pages 87-104.
    11. Massimiliano Amarante & Luigi Montrucchio, 2010. "The bargaining set of a large game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 43(3), pages 313-349, June.
    12. Leanne Streekstra & Christian Trudeau, 2024. "Stable source connection and assignment problems as multi-period shortest path problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(3), pages 939-975, September.
    13. 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.
    14. Stefano Moretti & Henk Norde, 2021. "A note on weighted multi-glove games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 721-732, November.
    15. Csóka, Péter & Herings, P. Jean-Jacques & Kóczy, László Á., 2009. "Stable allocations of risk," Games and Economic Behavior, Elsevier, vol. 67(1), pages 266-276, September.
    16. Rodica Brânzei & Vito Fragnelli & Stef Tijs, 2002. "Tree-connected peer group situations and peer group games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 93-106, March.
    17. Slikker, M. & Norde, H.W. & Tijs, S.H., 2000. "Information Sharing Games," Other publications TiSEM 9b7a7fab-c441-4b42-8eb1-e, Tilburg University, School of Economics and Management.
    18. Hamers, Herbert, 1997. "On the concavity of delivery games," European Journal of Operational Research, Elsevier, vol. 99(2), pages 445-458, June.
    19. Brânzei, R. & Tijs, S.H. & Timmer, J.B., 2000. "Cones of Games arising from Market Entry Problems," Other publications TiSEM 806aad7a-8085-43a2-af3f-e, Tilburg University, School of Economics and Management.
    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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:joptap:v:207:y:2025:i:3:d:10.1007_s10957-025-02806-1. 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.