A note on a selfish bin packing problem

In this paper, we consider a selfish bin packing problem, where each item is a selfish player and wants to minimize its cost. In our new model, if there are k items packed in the same bin, then each item pays a cost 1/k, where k ≥ 1. First we find a Nash Equilibrium (NE) in time O(n log n) within a social cost at most 1.69103OPT + 3, where OPT is the social cost of an optimal packing; where n is the number of items or players; then we give tight bounds for the worst NE on the social cost; finally we show that any feasible packing can be converged to a Nash Equilibrium in O(n2) steps without increasing the social cost.

[1]  Leah Epstein,et al.  Parametric Packing of Selfish Items and the Subset Sum Algorithm , 2009, WINE.

[2]  Guochuan Zhang,et al.  Bin Packing of Selfish Items , 2008, WINE.

[3]  Leah Epstein,et al.  Selfish Bin Packing , 2008, Algorithmica.

[4]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[5]  Paul G. Spirakis,et al.  The price of selfish routing , 2001, STOC '01.

[6]  Daniele Vigo,et al.  Bin Packing Approximation Algorithms: Combinatorial Analysis , 1999, Handbook of Combinatorial Optimization.

[7]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[8]  Shmuel Onn.  Convex Discrete Optimization , 2009, Encyclopedia of Optimization.

[9]  Vittorio Bilò.  On the packing of selfish items , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[10]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11]  Edward G. Coffman,et al.  A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing , 1981 .

[12]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[13]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[14]  David C. Fisher.  Next-fit packs a list and its reverse into the same number of bins , 1988 .

[15]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[16]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[17]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .