A cooperative bin packing game is an N -person game, where the player set N consists of k bins of capacity 1 each and n items of sizes $a_1,\dots,a_n$. The value of a coalition of players is defined to be the maximum total size of items in the coalition that can be packed into the bins of the coalition. We adopt the taxation model proposed by Faigle and Kern (1993)  and show that the 1/4-core is nonempty for all instances of the bin packing game. This strengthens the main result in .
|Name||Lecture Notes in Computer Science|
|Conference||19th International Conference on Computing and Combinatorics, COCOON 2013|
|Period||21/06/13 → 23/06/13|
|Other||21-23 June 2013|