{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T10:39:08Z","timestamp":1778668748345,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T00:00:00Z","timestamp":1502668800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00453-017-0361-x","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T15:35:33Z","timestamp":1502724933000},"page":"1534-1555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A General Bin Packing Game: Interest Taken into Account"],"prefix":"10.1007","volume":"80","author":[{"given":"Zhenbo","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,14]]},"reference":[{"key":"361_CR1","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 (IPDPS\u201906). IEEE (2006)","DOI":"10.1109\/IPDPS.2006.1639283"},{"key":"361_CR2","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman Jr","year":"2013","unstructured":"Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455\u2013531. Springer, New York (2013)"},{"key":"361_CR3","doi-asserted-by":"crossref","unstructured":"D\u00f3sa, G., Epstein, L.: Generalized selfish bin packing, arXiv:1202.4080 , pp. 1\u201343 (2012)","DOI":"10.1007\/978-3-642-27848-8_494-1"},{"key":"361_CR4","volume-title":"SAGT 2014, LNCS 8768","author":"G D\u00f3sa","year":"2014","unstructured":"D\u00f3sa, G., Epstein, L.: The convergence time for selfish bin packing. In: Lavi, R. (ed.) SAGT 2014, LNCS 8768. Springer, Heidelberg (2014)"},{"key":"361_CR5","unstructured":"D\u00f3sa, G., Sgall, J.: First Fit bin packing: a tight analysis. In: Portier, N. Wilke, T. (eds.) Proceedings of the 30th Symposium on the Theoretical Aspects of Computer Science (STACS 2013), pp.\u00a0538\u2013549. Kiel, Germany (2013)"},{"key":"361_CR6","volume-title":"ICALP 2014, Part I, LNCS 8572","author":"G D\u00f3sa","year":"2014","unstructured":"D\u00f3sa, G., Sgall, J.: Optimal analysis of Best Fit bin packing. In: Esparza, J. (ed.) ICALP 2014, Part I, LNCS 8572. Springer, Heidelberg (2014)"},{"issue":"2","key":"361_CR7","doi-asserted-by":"crossref","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"},{"key":"361_CR8","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"4","key":"361_CR9","doi-asserted-by":"crossref","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":"361_CR10","doi-asserted-by":"crossref","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":"361_CR11","unstructured":"Ullman, J. D.: The performance of a memory allocation algorithm. Technical Report 100. Princeton University, Princeton, NJ, (1971)"},{"key":"361_CR12","doi-asserted-by":"crossref","unstructured":"Yu, G., Zhang, G.: Bin packing of selfish items. In: The 4th International Workshop on Internet and Network Economics (WINE\u201908), pp. 446\u2013453 (2008)","DOI":"10.1007\/978-3-540-92185-1_50"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0361-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0361-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0361-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T07:44:10Z","timestamp":1570002250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0361-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,14]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["361"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0361-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,14]]}}}