Approximate core allocations and integrality gap for the bin packing game

DOI10.1016/J.TCS.2016.02.018MaRDI QIDQ265072zbMATH OpenOpenAlexFDO

Authors Xian Qiu, Walter Kern

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

cooperative gamecorebin packingintegrality gapsubset sum

Mathematics Subject Classification ID

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

Recommendations

• Approximate Core Allocation for Binpacking Games
• The 1/4-core of the uniform bin packing game is nonempty
• Integrality gap analysis for bin packing games
• Note on non-uniform bin packing games
• Improved Taxation Rate for Bin Packing Games

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• A 3/4-approximation algorithm for multiple subset sum
• Applications of approximation algorithms to cooperative games
• Approximate Core Allocation for Binpacking Games
• Bin packing games
• Complexity of core allocation for the bin packing game
• Cooperative facility location games
• Integrality gap analysis for bin packing games
• Note on non-uniform bin packing games
• On approximately fair cost allocation in Euclidean TSP games
• On some approximately balanced combinatorial cooperative games
• On the rate of taxation in a cooperative bin packing game
• Selfish bin packing
• The 1/4-core of the uniform bin packing game is nonempty
• The multiple subset sum problem

Cited in

(10)

• scientific article; zbMATH DE number 1164583 (Why is no real title available?)
• A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
• Complexity of core allocation for the bin packing game
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• Integrality gap analysis for bin packing games
• The 1/4-core of the uniform bin packing game is nonempty
• Note on non-uniform bin packing games
• Selfish colorful bin packing games
• Approximate core allocations for edge cover games
• Approximate core allocations for edge cover games

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

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