The Convergence Time for Selfish Bin Packing

  • György Dósa
  • Leah Epstein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8768)

Abstract

In classic bin packing, the objective is to partition a set of n items with positive rational sizes in (0,1] into a minimum number of subsets called bins, such that the total size of the items of each bin at most 1. We study a bin packing game where the cost of each bin is 1, and given a valid packing of the items, each item has a cost associated with it, such that the items that are packed into a bin share its cost equally. We find tight bounds on the exact worst-case number of steps in processes of convergence to pure Nash equilibria. Those are processes that are given an arbitrary packing. As long as there exists an item that can reduce its cost by moving from its bin to another bin, in each step, a controller selects such an item and instructs it to perform such a beneficial move. The process terminates when no further beneficial moves exist. The function of n that we find is Θ(n3/2), improving the previous bound of Han et al., who showed an upper bound of O(n2).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adar, R., Epstein, L.: Selfish bin packing with cardinality constraints. Theoretical Computer Science (to appear, 2013)Google Scholar
  2. 2.
    Bilò, V.: On the packing of selfish items. In: Proc. of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 9 pages. IEEE (2006)Google Scholar
  3. 3.
    Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms. PWS Publishing Company (1997)Google Scholar
  4. 4.
    Coffman Jr., E., Csirik, J.: Performance guarantees for one-dimensional bin packing. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, ch. 32, pp. 32-1–32-18. Chapman & Hall/CRC (2007)Google Scholar
  5. 5.
    Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 147–177 (1998)Google Scholar
  6. 6.
    Dósa, G., Epstein, L.: Generalized selfish bin packing (2012) (Manuscript)Google Scholar
  7. 7.
    Epstein, L., Kleiman, E.: Selfish bin packing. Algorithmica 60(2), 368–394 (2011)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Epstein, L., Kleiman, E., Mestre, J.: Parametric packing of selfish items and the subset sum algorithm. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 67–78. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibrium in load balancing. ACM Transactions on Algorithms 3(3), 32 (2007)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Faigle, U., Kern, W.: On some approximately balanced combinatorial cooperative games. Mathematical Methods of Operations Research 38(2), 141–152 (1993)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Faigle, U., Kern, W.: Approximate core allocation for binpacking games. SIAM Journal on Discrete Mathematics 11(3), 387–399 (1998)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Han, X., Dósa, G., Ting, H.-F., Ye, D., Zhang, Y.: A note on a selfish bin packing problem. Journal of Global Optimization 56(4), 1457–1462 (2013)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games and Economic Behavior 21(1-2), 85–101 (1997)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Ieong, S., McGrew, B., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: Proceedings of the 20th National Conference on Artificial Intelligence, pp. 489–494 (2005)Google Scholar
  15. 15.
    Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3, 256–278 (1974)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Kern, W., Qiu, X.: Integrality gap analysis for bin packing games. Operations Research Letters 40(5), 360–363 (2012)CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    Miyazawa, F.K., Vignatti, A.L.: Convergence time to Nash equilibrium in selfish bin packing. Electronic Notes in Discrete Mathematics 35, 151–156 (2009)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Miyazawa, F.K., Vignatti, A.L.: Bounds on the convergence time of distributed selfish bin packing. International Journal of Foundations of Computer Science 22(3), 565–582 (2011)CrossRefMATHMathSciNetGoogle Scholar
  19. 19.
    Nash, J.: Non-cooperative games. Annals of Mathematics 54(2), 286–295 (1951)CrossRefMATHMathSciNetGoogle Scholar
  20. 20.
    Yu, G., Zhang, G.: Bin packing of selfish items. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 446–453. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • György Dósa
    • 1
  • Leah Epstein
    • 2
  1. 1.Department of MathematicsUniversity of PannoniaVeszprémHungary
  2. 2.Department of MathematicsUniversity of HaifaHaifaIsrael

Personalised recommendations