Approximate core allocations for edge cover games
From MaRDI portal
Publication:6535804
DOI10.1007/978-3-031-39344-0_8MaRDI QIDQ6535804
Qizhi Fang, Tianhang Lu, Han Xiao
Publication date: 28 February 2024
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate core allocations and integrality gap for the bin packing game
- On the cores of games arising from integer edge covering functions of graphs
- Dominating set games.
- Traveling salesman games
- The nucleon of cooperative games and an algorithm for matching games
- On approximately fair cost allocation in Euclidean TSP games
- Integrality gap analysis for bin packing games
- On the core of traveling salesman games
- Solving covering problems and the uncapacitated plant location problem on trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The general graph matching game: approximate core
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
- Balancedness of edge covering games
- Combinatorial optimization. Packing and covering
- Computational Aspects of Cooperative Game Theory
- On some approximately balanced combinatorial cooperative games
- On the Core and f-Nucleolus of Flow Games
- Vertex packings: Structural properties and algorithms
- Finding a Minimum Circuit in a Graph
- Approximate Core Allocation for Binpacking Games
- Cooperative facility location games
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Integer Programming: Methods, Uses, Computations
- Introduction to the Theory of Cooperative Games
This page was built for publication: Approximate core allocations for edge cover games
