| Article ID: | iaor20102967 |
| Volume: | 37 |
| Issue: | 4 |
| Start Page Number: | 225 |
| End Page Number: | 229 |
| Publication Date: | Jul 2009 |
| Journal: | Operations Research Letters |
| Authors: | Liu Zhixin |
| Keywords: | packing |
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.