Approximate core allocations for edge cover games

DOI10.1007/978-3-031-39344-0_8MaRDI QIDQ6535804FDO

Authors Tianhang Lu, Han Xiao, Qizhi Fang

Publication date 28 February 2024

zbMATH Keywords

integrality gapapproximate corelinear program dualityedge cover game

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• \(k\)-edge-covering game
• On the cores of games arising from integer edge covering functions of graphs
• Coeur et nucléolus des jeux de recouvrement
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Core stability of vertex cover games

Cites work

• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• scientific article; zbMATH DE number 1445294 (Why is no real title available?)
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• A course in game theory.
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Approximate Core Allocation for Binpacking Games
• Approximate core allocations and integrality gap for the bin packing game
• Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
• Balancedness of edge covering games
• Combinatorial optimization. Packing and covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Computational Aspects of Cooperative Game Theory
• Cooperative facility location games
• Dominating set games.
• Finding a Minimum Circuit in a Graph
• Integer Programming: Methods, Uses, Computations
• Integrality gap analysis for bin packing games
• Introduction to the Theory of Cooperative Games
• On approximately fair cost allocation in Euclidean TSP games
• On some approximately balanced combinatorial cooperative games
• On the core and \(f\)-nucleolus of flow games
• On the core of traveling salesman games
• On the cores of games arising from integer edge covering functions of graphs
• Solving covering problems and the uncapacitated plant location problem on trees
• The general graph matching game: approximate core
• The nucleon of cooperative games and an algorithm for matching games
• Traveling salesman games
• Vertex packings: Structural properties and algorithms

This page was built for publication: Approximate core allocations for edge cover games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535804)