Approximate core allocations and integrality gap for the bin packing game

DOI10.1016/j.tcs.2016.02.018zbMath1338.91016OpenAlexW2282360390MaRDI QIDQ265072

Walter Kern, Xian Qiu

Publication date: 1 April 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.018

zbMATH Keywords

corecooperative gamebin packingintegrality gapsubset sum

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Combinatorial optimization (90C27) (n)-person games, (n>2) (91A06) Combinatorial games (91A46)

Related Items (3)

A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Approximate core allocations for edge cover games ⋮ Selfish colorful bin packing games

Cites Work

• Unnamed Item
• Selfish bin packing
• Complexity of core allocation for the bin packing game
• Bin packing games
• On approximately fair cost allocation in Euclidean TSP games
• A 3/4-approximation algorithm for multiple subset sum
• Integrality gap analysis for bin packing games
• Note on non-uniform bin packing games
• The Multiple Subset Sum Problem
• On some approximately balanced combinatorial cooperative games
• Approximate Core Allocation for Binpacking Games
• Cooperative facility location games
• On the rate of taxation in a cooperative bin packing game
• The 1/4-Core of the Uniform Bin Packing Game Is Nonempty
• Applications of approximation algorithms to cooperative games

This page was built for publication: Approximate core allocations and integrality gap for the bin packing game