{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:13:02Z","timestamp":1773778382355,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11201333"],"award-info":[{"award-number":["11201333"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971349"],"award-info":[{"award-number":["11971349"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11590-021-01782-5","type":"journal-article","created":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T08:03:10Z","timestamp":1627891390000},"page":"1445-1456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Selfish bin packing under Harmonic mean cost sharing mechanism"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0710-8498","authenticated-orcid":false,"given":"Ling","family":"Gai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,2]]},"reference":[{"key":"1782_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2013.05.041","volume":"495","author":"R Adara","year":"2013","unstructured":"Adara, R., Epstein, L.: Selfish bin packing with cardinality constraints. Theor. Comput. Sci. 495, 66\u201380 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1782_CR2","volume-title":"Games of Strategy","author":"D Avinash","year":"2009","unstructured":"Avinash, D., Skeath, S., Reiley, D.: Games of Strategy, 3rd edn. Norton Company, New York (2009)","edition":"3"},{"key":"1782_CR3","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 (IPDPS2006). IEEE, Rhodes, Greece, pp. 45-54(2006)","DOI":"10.1109\/IPDPS.2006.1639283"},{"issue":"3","key":"1782_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s10878-020-00599-9","volume":"40","author":"V Bil\u00f2","year":"2020","unstructured":"Bil\u00f2, V., Cellinese, F., Melideo, G., Monaco, G.: Selfish colorful bin packing games. J. Comb. Optim. 40(3), 610\u2013635 (2020)","journal-title":"J. Comb. Optim."},{"key":"1782_CR5","unstructured":"D\u00f2sa, G., Epstein, L.: Generalized selfish bin packing. ArXiv:1202.4080 [cs.GT](2012)"},{"key":"1782_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.ipl.2019.06.002","volume":"150","author":"G D\u00f2sa","year":"2019","unstructured":"D\u00f2sa, G.: A new lower bound on the price of anarchy of selfish bin packing. Inf. Process. Lett. 150, 6\u201312 (2019a)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1782_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ejor.2019.04.026","volume":"278","author":"G D\u00f2sa","year":"2019","unstructured":"D\u00f2sa, G.: Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278(1), 160\u2013169 (2019c)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1782_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case Equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"1782_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"},{"key":"1782_CR10","doi-asserted-by":"crossref","unstructured":"Epstein, L.: Selfish Bin Packing Problems. In: Kao, M.Y. (eds) Encyclopedia of Algorithms. LNCS, pp. 1927-1930, Springer, Boston, MA (2016)","DOI":"10.1007\/978-1-4939-2864-4_494"},{"issue":"4","key":"1782_CR11","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1007\/s10898-012-9856-9","volume":"56","author":"X Han","year":"2013","unstructured":"Han, X., D\u00f2sa, G.: A note on a selfish bin packing problem. J. Glob. Optim. 56(4), 1457\u20131462 (2013)","journal-title":"J. Glob. Optim."},{"key":"1782_CR12","first-page":"446","volume-title":"WINE","author":"G Yu","year":"2008","unstructured":"Yu, G., Zhang, G.: Bin Packing of Selfish Items. In: Papadimitriou, C., Zhang, S. (eds.) WINE, vol. 5385, pp. 446\u2013453. Berlin, Springer (2008)"},{"key":"1782_CR13","first-page":"404","volume-title":"Worst-case equilibria","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C., Meinel, C., Tison, S.: Worst-case equilibria, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"1782_CR14","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1007\/s00453-017-0361-x","volume":"80","author":"GBP Game","year":"2018","unstructured":"Game, G.B.P., Wang, Z., Han, X., D\u00f2sa, G.: Interest taken into account. Algorithmica 80, 1534\u20131555 (2018)","journal-title":"Algorithmica"},{"key":"1782_CR15","doi-asserted-by":"publisher","unstructured":"Zhang, W., Gao, A., Gai, L.: Selfish Bin Packing with Parameterized Punishment. In: Zhang, Z., Li, W., Du, DZ. (eds.) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science, vol. 12290. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-57602-8_22(2020)","DOI":"10.1007\/978-3-030-57602-8_22(2020)"},{"key":"1782_CR16","first-page":"26985","volume":"1\u201316","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Zhang, G.: From packing rules to cost-sharing mechanisms. J. Comb. Optim. 1\u201316, 26985 (2020)","journal-title":"J. Comb. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01782-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01782-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01782-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:17:48Z","timestamp":1652199468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01782-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,2]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1782"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01782-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,2]]},"assertion":[{"value":"5 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}