IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2308.11222.html
   My bibliography  Save this paper

Approximate Core Allocations for Edge Cover Games

Author

Listed:
  • Tianhang Lu
  • Han Xian
  • Qizhi Fang

Abstract

We study the approximate core for edge cover games, which are cooperative games stemming from edge cover problems. In these games, each player controls a vertex on a network $G = (V, E; w)$, and the cost of a coalition $S\subseteq V$ is equivalent to the minimum weight of edge covers in the subgraph induced by $S$. We prove that the 3/4-core of edge cover games is always non-empty and can be computed in polynomial time by using linear program duality approach. This ratio is the best possible, as it represents the integrality gap of the natural LP for edge cover problems. Moreover, our analysis reveals that the ratio of approximate core corresponds with the length of the shortest odd cycle of underlying graphs.

Suggested Citation

  • Tianhang Lu & Han Xian & Qizhi Fang, 2023. "Approximate Core Allocations for Edge Cover Games," Papers 2308.11222, arXiv.org.
    • Handle: RePEc:arx:papers:2308.11222
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2308.11222
    File Function: Latest version
    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. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, December.
    3. Bezalel Peleg & Peter Sudhölter, 2007. "Introduction to the Theory of Cooperative Games," Theory and Decision Library C, Springer, edition 0, number 978-3-540-72945-7, March.
    4. Kolen, Antoon, 1983. "Solving covering problems and the uncapacitated plant location problem on trees," European Journal of Operational Research, Elsevier, vol. 12(3), pages 266-278, March.
    5. M. L. Balinski, 1965. "Integer Programming: Methods, Uses, Computations," Management Science, INFORMS, vol. 12(3), pages 253-313, November.
    6. Walter Kern & Daniël Paulusma, 2009. "On the Core and f -Nucleolus of Flow Games," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 981-991, November.
    7. Vazirani, Vijay V., 2022. "The general graph matching game: Approximate core," Games and Economic Behavior, Elsevier, vol. 132(C), pages 478-486.
    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. 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. Vijay V. Vazirani, 2023. "LP-Duality Theory and the Cores of Games," Papers 2302.07627, arXiv.org, revised Mar 2023.
    2. 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.
    3. 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.
    4. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.
    5. Westerink-Duijzer, L.E. & Schlicher, L.P.J. & Musegaas, M., 2019. "Fair allocations for cooperation problems in vaccination," Econometric Institute Research Papers EI2019-06, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Peter Biro & Walter Kern & Daniel Paulusma, 2011. "Computing Solutions for Matching Games," CERS-IE WORKING PAPERS 1142, Institute of Economics, Centre for Economic and Regional Studies.
    7. Routledge R. R., 2012. "On Communication and the Weak Sequential Core," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 12(1), pages 1-22, September.
    8. Jean-François Caulier, 2009. "A note on the monotonicity and superadditivity of TU cooperative games," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00633612, HAL.
    9. 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.
    10. Jean-François Caulier, 2009. "A note on the monotonicity and superadditivity of TU cooperative games," Working Papers hal-00633612, HAL.
    11. 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.
    12. 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.
    13. Fatma Aslan & Papatya Duman & Walter Trockel, 2020. "Non-cohesive TU-games: Duality and P-core," Working Papers CIE 136, Paderborn University, CIE Center for International Economics.
    14. Shoshana Anily & Moshe Haviv, 2014. "Subadditive and Homogeneous of Degree One Games Are Totally Balanced," Operations Research, INFORMS, vol. 62(4), pages 788-793, August.
    15. Fatma Aslan & Papatya Duman & Walter Trockel, 2020. "Non-cohesive TU-games: Efficiency and Duality," Working Papers CIE 138, Paderborn University, CIE Center for International Economics.
    16. Han Xiao & Tianhang Lu & Qizhi Fang, 2021. "Approximate Core Allocations for Multiple Partners Matching Games," Papers 2107.01442, arXiv.org, revised Oct 2021.
    17. Péter Biró & Walter Kern & Daniël Paulusma, 2012. "Computing solutions for matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
    18. Shellshear, Evan, 2011. "On core stability and extendability," Center for Mathematical Economics Working Papers 387, Center for Mathematical Economics, Bielefeld University.
    19. Battigalli, Pierpaolo & Bonanno, Giacomo, 1997. "The Logic of Belief Persistence," Economics and Philosophy, Cambridge University Press, vol. 13(1), pages 39-59, April.
    20. Szabó, György & Borsos, István & Szombati, Edit, 2019. "Games, graphs and Kirchhoff laws," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 416-423.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2308.11222. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.