Article ID Journal Published Year Pages File Type
1143108 Operations Research Letters 2009 5 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Complexity of core allocation for the bin packing game
Authors
,