Approximate Core Allocations for Edge Cover Games
Authors: 
Tianhang Lu, 
Han Xiao, Qizhi FangAuthors Info & Claims
Tianhang Lu, Han Xiao, Qizhi FangAuthors Info & ClaimsPages 105 - 115
Abstract
Edge cover games are cooperative cost games arising from edge cover problems, where each player controls a vertex and the cost of a coalition is the minimum weight of edge covers in the subgraph induced by the coalition. In this paper, we study the approximate core for edge cover games. We show that the ratio of approximate core depends on the shortest odd cycle of underlying graphs and the -core is always non-empty. We also show that the approximate ratio is tight, since it coincides with the integrality gap of the natural LP for edge cover problems.
References
[1]
Schrijver A Combinatorial Optimization: Polyhedra and Efficiency 2003 Berlin Springer
[2]
Balinski ML Integer programming: methods, uses, computations Manag. Sci. 1965 12 3 253-313
[3]
Chalkiadakis G, Elkind E, and Wooldridge M Computational aspects of cooperative game theory Synth. Lect. Artif. Intell. Mach. Learn. 2011 5 6 1-168
[4]
Cornuéjols, G.: Combinatorial Optimization: Packing and Covering. SIAM (2001)
[5]
Carr, R., Vempala, S.: Towards a approximation for the asymmetric traveling salesman problem. In: SODA, pp. 116–125 (2000)
[6]
Deng X, Ibaraki T, and Nagamochi H Algorithmic aspects of the core of combinatorial optimization games Math. Oper. Res. 1999 24 3 751-766
[7]
Edmonds, J.: Matching: a well-solved class of integer programs. Combinatorial Structures and their Applications, pp. 89–92 (1970)
[8]
Faigle U, Fekete SP, Hochstättler W, and Kern W On approximately fair cost allocation in Euclidean TSP games Oper. Res. Spektrum 1998 20 1 29-37
[9]
Faigle U and Kern W On some approximately balanced combinatorial cooperative games Z. Oper. Res. 1993 38 2 141-152
[10]
Faigle U and Kern W Approximate core allocation for binpacking games SIAM J. Discret. Math. 1998 11 3 387-399
[11]
Faigle U, Kern W, Fekete SP, and Hochstättler W The nucleon of cooperative games and an algorithm for matching games Math. Program. 1998 83 1–3 195-211
[12]
Gillies DB Solutions to general non-zero-sum games Contrib. Theory Games 1959 4 40 47-85
[13]
Goemans MX and Skutella M Cooperative facility location games J. Algorithms 2004 50 2 194-214
[14]
Huang D and Pettie S Approximate generalized matching: -factors and -edge covers Algorithmca 2022 84 1952-1992
[15]
Itai A and Rodeh M Finding a minimum circuit in a graph SIAM J. Comput. 1978 7 4 413-423
[16]
Kern, W., Paulusma, D.: On the core and f-nucleolus of flow games. Math. Oper. Res. 12 (2009)
[17]
Kern W and Qiu X Integrality gap analysis for bin packing games Oper. Res. Lett. 2012 40 5 360-363
[18]
Kim HK Note on fractional edge covering games Glob. J. Pure Appl. Math. 2016 12 6 4661-4675
[19]
Kolen A Solving covering problems and the uncapacitated plant location problem on trees Eur. J. Oper. Res. 1983 12 3 266-278
[20]
Liu Y and Fang Q Balancedness of edge covering games Appl. Math. Lett. 2007 20 10 1064-1069
[21]
Nemhauser G and Trotter LE Vertex packings: structural properties and algorithms Math. Program. 1975 8 1 232-248
[22]
Osborne MJ and Rubinstein A A Course in Game Theory 1994 Cambridge MIT Press
[23]
Park B, Kim SR, and Kim HK On the cores of games arising from integer edge covering functions of graphs J. Comb. Optim. 2013 26 4 786-798
[24]
Peleg B and Sudhölter P Introduction to the Theory of Cooperative Games 2007 Heidelberg Springer
[25]
Potters JA, Curiel IJ, and Tijs SH Traveling salesman games Math. Program. 1992 53 1 199-211
[26]
Qiu X and Kern W Approximate core allocations and integrality gap for the bin packing game Theor. Comput. Sci. 2016 627 26-35
[27]
Sun L and Karwan MH On the core of traveling salesman games Oper. Res. Lett. 2015 43 4 365-369
[28]
Vazirani VV The general graph matching game: approximate core Games Econom. Behav. 2022 132 478-486
[29]
van Velzen B Dominating set games Oper. Res. Lett. 2004 32 6 565-573
[30]
Xiao, H., Lu, T., Fang, Q.: Approximate core allocations for multiple partners matching games. arXiv:2107.01442 (2021)
Recommendations
Approximate core allocations for edge cover games
AbstractEdge cover games are cooperative cost games arising from edge cover problems. In an edge cover game, each player controls a vertex and the cost of a coalition is the minimum weight of edge covers in the subgraph induced by the coalition. The ...
Approximate core allocations and integrality gap for the bin packing game
A cooperative (uniform) bin packing game is an N-person game, where the player set consists of k bins of capacity 1 each and n items of sizes a 1 , , a n . The value of a coalition of players is defined to be the maximum total size of items in the ...
Fractional f-Edge Cover Chromatic Index of Graphs
Let G be a graph, and let f be an integer function on V with $${1\leq f(v)\leq d(v)}$$ to each vertex $${\upsilon \in V}$$ . An f -edge cover coloring is a coloring of edges of E ( G ) such that each color appears at each vertex $${\upsilon \in V(G)}$$ at least f ( ) times. The maximum number of colors needed ...
Comments
Information & Contributors
Information
Published In
Aug 2023
311 pages
© Springer Nature Switzerland AG 2023.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 26 August 2023
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Jul 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in