Complexity of core allocation for the bin packing game

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.