Approximate core allocations for edge cover games
From MaRDI portal
Publication:6122606
DOI10.1016/j.tcs.2024.114433arXiv2308.11222OpenAlexW4391543623MaRDI QIDQ6122606
Han Xiao, Qizhi Fang, Tianhang Lu
Publication date: 1 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.11222
Cites Work
- 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
- Traveling salesman 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
- Universally balanced combinatorial optimization games
- Balancedness of edge covering games
- The assignment game. I: The core
- On some approximately balanced combinatorial cooperative games
- Minimum cost spanning tree games
- Generalized Network Problems Yielding Totally Balanced 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
- Game Theory
- Algorithmic Game Theory
