{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:00:19Z","timestamp":1743051619022,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_51","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"697-711","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7841-157X","authenticated-orcid":false,"given":"Yoshiharu","family":"Kohayakawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1067-6421","authenticated-orcid":false,"given":"Fl\u00e1vio Keidi","family":"Miyazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8229-3139","authenticated-orcid":false,"given":"Yoshiko","family":"Wakabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013324. University Press (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. http:\/\/arxiv.org\/abs\/1708.03228 (2017)","DOI":"10.1007\/978-3-319-89441-6_9"},{"key":"51_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-18318-8_3","volume-title":"Approximation and Online Algorithms","author":"J Balogh","year":"2011","unstructured":"Balogh, J., B\u00e9k\u00e9si, 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\u201336. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18318-8_3"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V.: On the packing of selfish items. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium, pp. 9\u201318. IEEE (2006)","DOI":"10.1109\/IPDPS.2006.1639283"},{"key":"51_CR5","unstructured":"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\u201393. PWS (1997)"},{"issue":"8","key":"51_CR6","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF00289157","volume":"26","author":"J Csirik","year":"1989","unstructured":"Csirik, J.: An on-line algorithm for variable-sized bin packing. Acta Inform. 26(8), 697\u2013709 (1989)","journal-title":"Acta Inform."},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(93)90004-Z","volume":"13","author":"J Csirik","year":"1993","unstructured":"Csirik, J., van Vliet, A.: An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. 13, 149\u2013158 (1993)","journal-title":"Oper. Res. Lett."},{"key":"51_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-642-40313-2_2","volume-title":"Mathematical Foundations of Computer Science 2013","author":"L Epstein","year":"2013","unstructured":"Epstein, L.: Bin packing games with selfish items. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 8\u201321. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_2"},{"issue":"2","key":"51_CR9","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00453-009-9348-6","volume":"60","author":"L Epstein","year":"2011","unstructured":"Epstein, L., Kleiman, E.: Selfish bin packing. Algorithmica 60(2), 368\u2013394 (2011)","journal-title":"Algorithmica"},{"issue":"2","key":"51_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.disopt.2006.11.005","volume":"4","author":"L Epstein","year":"2007","unstructured":"Epstein, L., van Stee, R.: Bounds for online bounded space hypercube packing. Discrete Optim. 4(2), 185\u2013197 (2007)","journal-title":"Discrete Optim."},{"issue":"1","key":"51_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00453-014-9942-0","volume":"74","author":"L Epstein","year":"2016","unstructured":"Epstein, L., Kleiman, E., Mestre, J.: Parametric packing of selfish items and the subset sum algorithm. Algorithmica 74(1), 177\u2013207 (2016)","journal-title":"Algorithmica"},{"issue":"2","key":"51_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0097539705446895","volume":"35","author":"L Epstein","year":"2005","unstructured":"Epstein, L., van Stee, R.: Optimal online algorithms for multidimensional packing problems. SIAM J. Comput. 35(2), 431\u2013448 (2005)","journal-title":"SIAM J. Comput."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013374 (2011)","DOI":"10.1016\/j.endm.2011.05.063"},{"key":"51_CR14","unstructured":"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)"},{"key":"51_CR15","unstructured":"Heydrich, S., van Stee, R.: Beating the harmonic lower bound for online bin packing. In: ICALP 2016. LIPIcs, vol. 55, pp. 41:1\u201341:14. Dagstuhl, Germany (2016). http:\/\/arxiv.org\/abs\/1511.00876v5"},{"key":"51_CR16","doi-asserted-by":"crossref","unstructured":"Heydrich, S., van Stee, R.: Improved lower bounds for online hypercube packing. http:\/\/arxiv.org\/abs\/1607.01229 (2016)","DOI":"10.1007\/978-1-4939-2864-4_493"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-319-77404-6_51"},{"key":"51_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 1999","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"issue":"4","key":"51_CR19","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1007\/s10898-012-9856-9","volume":"56","author":"R Ma","year":"2013","unstructured":"Ma, R., D\u00f3sa, G., Han, X., Ting, H.F., Ye, D., Zhang, Y.: A note on a selfish bin packing problem. J. Glob. Optim. 56(4), 1457\u20131462 (2013)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"51_CR20","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"51_CR21","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1137\/S0895480100369948","volume":"14","author":"SS Seiden","year":"2001","unstructured":"Seiden, S.S.: An optimal online algorithm for bounded space variable-sized bin packing. SIAM J. Discrete Math. 14, 458\u2013470 (2001)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"51_CR22","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"SS Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. Assoc. Comput. Mach. 49(5), 640\u2013671 (2002)","journal-title":"J. Assoc. Comput. Mach."},{"key":"51_CR23","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A van Vliet","year":"1992","unstructured":"van Vliet, A.: An improved lower bound for online bin packing algorithms. Inf. Process. Lett. 43, 277\u2013284 (1992)","journal-title":"Inf. Process. Lett."},{"key":"51_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-92185-1_50","volume-title":"Internet and Network Economics","author":"G Yu","year":"2008","unstructured":"Yu, G., Zhang, G.: Bin packing of selfish items. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 446\u2013453. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_50"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:04:30Z","timestamp":1709827470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}