Complexity of core allocation for the bin packing game

Authors:
Zhixin Liu
Affiliations:
Department of Management Studies, School of Management, University of Michigan-Dearborn, 19000 Hubbard Drive, Dearborn, MI 48126-2638, United States
Venue:
Operations Research Letters
Year:
2009

Citing 5
Cited 0

On the complexity of cooperative solution concepts

Mathematics of Operations Research
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Approximate Core Allocation for Binpacking Games

SIAM Journal on Discrete Mathematics
Algorithmic Aspects of the Core of Combinatorial Optimization Games

Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides complexity results and develops optimal algorithms for core membership and emptiness tests of the bin packing game. Our algorithms find the maximum surplus profit, the least integer core value, and the minimum value required by the grand coalition for the existence of an integer core allocation.