Bin Packing of Selfish Items

We study a bin packing game in which any item to be packed is handled by a selfish agent. Each agent aims at minimizing his sharing cost with the other items staying in the same bin, where the social cost is the number of bins used. We first show that computing a pure Nash equilibrium can be done in polynomial time. We then prove that the price of anarchy for the game is in between 1.6416 and 1.6575, improving the previous bounds.

[1]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

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

[3]  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).

[4]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

[5]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[6]  Martin Gairing,et al.  Nashification and the Coordination Ratio for a Selfish Routing Game , 2003, ICALP.

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

[8]  Alberto Caprara,et al.  Worst-case analysis of the subset sum algorithm for bin packing , 2004, Oper. Res. Lett..

[9]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

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

[12]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[13]  Yishay Mansour,et al.  Convergence Time to Nash Equilibria , 2003, ICALP.

[14]  Paul G. Spirakis,et al.  Approximate Equilibria and Ball Fusion , 2003, Theory of Computing Systems.

[15]  György Dósa,et al.  The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.

[16]  Mike Paterson,et al.  Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers , 2007, ESCAPE.

[17]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[18]  Paul G. Spirakis,et al.  The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..