Pareto optimal equilibria for selfish bin packing with uniform cost sharing

Bin packing problems deal with packing a set of items with sizes in (0, 1] into a minimum number of subsets, called bins, whose total sizes are no larger than 1. We study a class of bin packing games where the cost of an item packed into a bin with k items is $$\frac{1}{k}$$1k, that is, the cost sharing of each bin is uniform. We study the quality of strictly Pareto optimal equilibria and weakly Pareto optimal equilibria for these games.

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

[2]  Yonatan Aumann,et al.  Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games , 2010, SAGT.

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

[4]  Haim Kaplan,et al.  Strong Price of Anarchy for Machine Load Balancing , 2007, ICALP.

[5]  Leah Epstein,et al.  Quality of strong equilibria for selfish bin packing with uniform cost sharing , 2019, J. Sched..

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

[7]  Leah Epstein,et al.  Generalized selfish bin packing , 2012, ArXiv.

[8]  Leah Epstein,et al.  Parametric Packing of Selfish Items and the Subset Sum Algorithm , 2014, Algorithmica.

[9]  Robert J. Aumann,et al.  16. Acceptable Points in General Cooperative n-Person Games , 1959 .

[10]  Steve Chien,et al.  Strong and Pareto Price of Anarchy in Congestion Games , 2009, ICALP.

[11]  J. Nash.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[12]  Yishay Mansour,et al.  Strong equilibrium in cost sharing connection games , 2007, EC '07.

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

[14]  Leah Epstein,et al.  On the quality and complexity of pareto equilibria in the job scheduling game , 2011, AAMAS.

[15]  Yoav Shoham,et al.  Fast and Compact: A Simple Class of Congestion Games , 2005, AAAI.

[16]  Yishay Mansour,et al.  Strong price of anarchy , 2007, SODA '07.

[17]  Carlos Eduardo Ferreira,et al.  Selfish Square Packing , 2011, Electron. Notes Discret. Math..

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

[19]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[20]  R. Holzman,et al.  Strong Equilibrium in Congestion Games , 1997 .

[21]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[22]  Deshi Ye,et al.  A note on a selfish bin packing problem , 2013, J. Glob. Optim..

[23]  Pradeep Dubey,et al.  Inefficiency of Nash Equilibria , 1986, Math. Oper. Res..