A cooperative bin packing game is a $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 present an alternative proof for the non-emptiness of the 1/3-core for all bin packing games and show how to improve this bound $\epsilon = 1/3$ (slightly). We conjecture that the true best possible value is $\epsilon= 1/7$.
|Name||Lecture Notes in Computer Science|
|Conference||First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011|
|Period||18/04/11 → 20/04/11|
|Other||18-20 April 2011|