{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:13:04Z","timestamp":1773778384484,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371317"],"award-info":[{"award-number":["12371317"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10878-024-01239-2","type":"journal-article","created":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T19:22:07Z","timestamp":1733340127000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New bounds on the price of anarchy of selfish bin packing with partial punishment"],"prefix":"10.1007","volume":"49","author":[{"given":"Xiaowei","family":"Li","sequence":"first","affiliation":[]},{"given":"Peihai","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,4]]},"reference":[{"key":"1239_CR1","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V (2006) On the packing of selfish items. In: Proceedings of the 20th international parallel and distributed processing symposium, IPDPS\u201906, pp 25\u201329","DOI":"10.1109\/IPDPS.2006.1639283"},{"issue":"3","key":"1239_CR2","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 (2020) Selfish colorful bin packing games. J Comb Optim 40(3):610\u2013635","journal-title":"J Comb Optim"},{"issue":"1","key":"1239_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00453-016-0248-2","volume":"80","author":"M B\u00f6hm","year":"2018","unstructured":"B\u00f6hm M, D\u00f3sa G, Epstein L, Sgall J, Vesel\u00fd P (2018) Colored bin packing: online algorithms and lower bounds. Algorithmica 80(1):155\u2013184","journal-title":"Algorithmica"},{"issue":"50","key":"1239_CR4","doi-asserted-by":"publisher","first-page":"7049","DOI":"10.1016\/j.tcs.2011.09.017","volume":"412","author":"Z Cao","year":"2011","unstructured":"Cao Z, Yang X (2011) Selfish bin covering. Theoret Comput Sci 412(50):7049\u20137058","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"1239_CR5","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/s10878-019-00476-0","volume":"42","author":"X Chen","year":"2021","unstructured":"Chen X, Nong Q, Fang Q (2021) An improved mechanism for selfish bin packing. J Comb Optim 42(3):636\u2013656","journal-title":"J Comb Optim"},{"key":"1239_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: a survey. Comput Sci Rev 24:63\u201379","journal-title":"Comput Sci Rev"},{"key":"1239_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.ipl.2019.06.002","volume":"150","author":"G D\u00f3sa","year":"2019","unstructured":"D\u00f3sa G, Epstein L (2019) A new lower bound on the price of anarchy of selfish bin packing. Inf Process Lett 150:6\u201312","journal-title":"Inf Process Lett"},{"issue":"1","key":"1239_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ejor.2019.04.026","volume":"278","author":"G D\u00f3sa","year":"2019","unstructured":"D\u00f3sa G, Kellerer H, Tuza Z (2019) Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur J Oper Res 278(1):160\u2013169","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1239_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 (2011) Selfish bin packing. Algorithmica 60(2):368\u2013394","journal-title":"Algorithmica"},{"key":"1239_CR10","doi-asserted-by":"publisher","first-page":"2952","DOI":"10.1007\/s00453-021-00849-0","volume":"83","author":"L Epstein","year":"2021","unstructured":"Epstein L, Kleiman E (2021) Selfish vector packing. Algorithmica 83:2952\u20132988","journal-title":"Algorithmica"},{"issue":"03","key":"1239_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1142\/S0129054119500096","volume":"30","author":"CG Fernandes","year":"2019","unstructured":"Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y (2019) Prices of anarchy of selfish 2D bin packing games. Int J Found Comput Sci 30(03):355\u2013374","journal-title":"Int J Found Comput Sci"},{"key":"1239_CR12","doi-asserted-by":"publisher","first-page":"114276","DOI":"10.1016\/j.tcs.2023.114276","volume":"982","author":"L Gai","year":"2024","unstructured":"Gai L, Zhang W, Zhang Z (2024) Selfish bin packing with punishment. Theoret Comput Sci 982:114276","journal-title":"Theoret Comput Sci"},{"key":"1239_CR13","doi-asserted-by":"crossref","unstructured":"Hoberg R, Rothvoss T (2017) A logarithmic additive integrality gap for bin packing. In: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA\u201917, pp 2616\u20132625","DOI":"10.1137\/1.9781611974782.172"},{"issue":"4","key":"1239_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):299\u2013325","journal-title":"SIAM J Comput"},{"issue":"2","key":"1239_CR15","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 (2009) Worst-case equilibria. Comput Sci Rev 3(2):65\u201369","journal-title":"Comput Sci Rev"},{"issue":"4","key":"1239_CR16","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 HF, Ye D, Zhang Y (2013) A note on a selfish bin packing problem. J Glob Optim 56(4):1457\u20131462","journal-title":"J Glob Optim"},{"key":"1239_CR17","unstructured":"Wang C, Zhang G (2023) Best cost-sharing rule design for selfish bin packing. In: Proceedings of the 19th international workshop on internet and network economics, WINE\u201923, pp 710\u2013710"},{"key":"1239_CR18","doi-asserted-by":"crossref","unstructured":"Yu G, Zhang G (2008) Bin packing of selfish items. In: Proceedings of the 4th international workshop on internet and network economics, WINE\u201908, pp 446\u2013453","DOI":"10.1007\/978-3-540-92185-1_50"},{"issue":"3","key":"1239_CR19","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1007\/s10878-019-00519-6","volume":"44","author":"C Zhang","year":"2022","unstructured":"Zhang C, Zhang G (2022) From packing rules to cost-sharing mechanisms. J Comb Optim 44(3):1578\u20131593","journal-title":"J Comb Optim"},{"key":"1239_CR20","doi-asserted-by":"crossref","unstructured":"Zhang W, Gao A, Gai L (2020) Selfish bin packing with parameterized punishment. In: Proceedings of the 14th international conference on algorithmic aspects in information and management, AAIM\u201920, pp 238\u2013247","DOI":"10.1007\/978-3-030-57602-8_22"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01239-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01239-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01239-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T19:03:28Z","timestamp":1737745408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01239-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,4]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1239"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01239-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,4]]},"assertion":[{"value":"5 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"4"}}