Abstract
We prove a tight lower bound on the asymptotic performance ratio \(\rho \) of the bounded space online d-hypercube bin packing problem, solving an open question raised in 2005. In the classic d-hypercube bin packing problem, we are given a sequence of d-dimensional hypercubes and we have an unlimited number of bins, each of which is a d-dimensional unit hypercube. The goal is to pack (orthogonally) the given hypercubes into the minimum possible number of bins, in such a way that no two hypercubes in the same bin overlap. The bounded space online d-hypercube bin packing problem is a variant of the d-hypercube bin packing problem, in which the hypercubes arrive online and each one must be packed in an open bin without the knowledge of the next hypercubes. Moreover, at each moment, only a constant number of open bins are allowed (whenever a new bin is used, it is considered open, and it remains so until it is considered closed, in which case, it is not allowed to accept new hypercubes). Epstein and van Stee (SIAM J Comput 35(2):431–448, 2005) showed that \(\rho \) is \(\varOmega (\log d)\) and \(O(d/\log d)\), and conjectured that it is \(\varTheta (\log d)\). We show that \(\rho \) is in fact \(\varTheta (d/\log d)\). To obtain this result, we elaborate on some ideas presented by those authors, and go one step further showing how to obtain better (offline) packings of certain special instances for which one knows how many bins any bounded space algorithm has to use. Our main contribution establishes the existence of such packings, for large enough d, using probabilistic arguments. Such packings also lead to lower bounds for the prices of anarchy of the selfish d-hypercube bin packing game. We present a lower bound of \(\varOmega (d/\log d)\) for the pure price of anarchy of this game, and we also give a lower bound of \(\varOmega (\log d)\) for its strong price of anarchy.
The first author was partially supported by FAPESP (2013/03447-6, 2013/07699-0), CNPq (310974/2013-5, 459335/2014-6) and NUMEC/USP (Project MaCLinC). The second author was partially supported by CNPq (311499/2014-7, 425340/2016-3) and FAPESP (2015/11937-9, 2016/01860-1, 2016/23552-7). The third author was partially supported by CNPq (456792/2014-7, 306464/2016-0) and FAPESP (2015/11937-9).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Luce, R.D., Tucker, A.W. (eds.) Contribution to the Theory of Game IV, Annals of Mathematical Study, vol. 40, pp. 287–324. University Press (1959)
Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. http://arxiv.org/abs/1708.03228 (2017)
Balogh, J., Békési, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol. 6534, pp. 25–36. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-18318-8_3
Bilò, V.: On the packing of selfish items. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium, pp. 9–18. IEEE (2006)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey, chap. 2. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, pp. 46–93. PWS (1997)
Csirik, J.: An on-line algorithm for variable-sized bin packing. Acta Inform. 26(8), 697–709 (1989)
Csirik, J., van Vliet, A.: An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. 13, 149–158 (1993)
Epstein, L.: Bin packing games with selfish items. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 8–21. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40313-2_2
Epstein, L., Kleiman, E.: Selfish bin packing. Algorithmica 60(2), 368–394 (2011)
Epstein, L., van Stee, R.: Bounds for online bounded space hypercube packing. Discrete Optim. 4(2), 185–197 (2007)
Epstein, L., Kleiman, E., Mestre, J.: Parametric packing of selfish items and the subset sum algorithm. Algorithmica 74(1), 177–207 (2016)
Epstein, L., van Stee, R.: Optimal online algorithms for multidimensional packing problems. SIAM J. Comput. 35(2), 431–448 (2005)
Fernandes, C.G., Ferreira, C.E., Miyazawa, F.K., Wakabayashi, Y.: Selfish square packing. In: Proceedings of the VI Latin-American Algorithms, Graphs and Optimization Symposium. Electronic Notes in Discrete Mathematics, vol. 37, pp. 369–374 (2011)
Fernandes, C.G., Ferreira, C.E., Miyazawa, F.K., Wakabayashi, Y.: Prices of anarchy of selfish 2D bin packing games. http://arxiv.org/abs/1707.07882 (2017)
Heydrich, S., van Stee, R.: Beating the harmonic lower bound for online bin packing. In: ICALP 2016. LIPIcs, vol. 55, pp. 41:1–41:14. Dagstuhl, Germany (2016). http://arxiv.org/abs/1511.00876v5
Heydrich, S., van Stee, R.: Improved lower bounds for online hypercube packing. http://arxiv.org/abs/1607.01229 (2016)
Kohayakawa, Y., Miyazawa, F.K., Wakabayashi, Y.: A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. http://arxiv.org/abs/1712.06763 (2017)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49116-3_38
Ma, R., Dósa, G., Han, X., Ting, H.F., Ye, D., Zhang, Y.: A note on a selfish bin packing problem. J. Glob. Optim. 56(4), 1457–1462 (2013)
Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286–295 (1951)
Seiden, S.S.: An optimal online algorithm for bounded space variable-sized bin packing. SIAM J. Discrete Math. 14, 458–470 (2001)
Seiden, S.S.: On the online bin packing problem. J. Assoc. Comput. Mach. 49(5), 640–671 (2002)
van Vliet, A.: An improved lower bound for online bin packing algorithms. Inf. Process. Lett. 43, 277–284 (1992)
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). https://doi.org/10.1007/978-3-540-92185-1_50
Acknowledgements
We thank the referees for helpful suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Kohayakawa, Y., Miyazawa, F.K., Wakabayashi, Y. (2018). A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. In: Bender, M., Farach-Colton, M., Mosteiro, M. (eds) LATIN 2018: Theoretical Informatics. LATIN 2018. Lecture Notes in Computer Science(), vol 10807. Springer, Cham. https://doi.org/10.1007/978-3-319-77404-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-319-77404-6_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77403-9
Online ISBN: 978-3-319-77404-6
eBook Packages: Computer ScienceComputer Science (R0)