An improved mechanism for selfish bin packing

Selfish bin packing can be viewed as the non-cooperative version of bin packing problem, where every item is a selfish agent and wants to minimize his sharing cost with the other items packing in the same bin. In this paper, we focus on designing a new mechanism (a payoff rule) for selfish bin packing, called modified Dutch treatment mechanism. We first show that the pure Nash equilibrium exists and it can be obtained in polynomial time. We then prove that under the new mechanism, the price of anarchy is between 1.47407 and 1.4748, improving the known results.