{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:48:03Z","timestamp":1776109683358,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007839","name":"Yunnan University","doi-asserted-by":"publisher","award":["KC-252511650"],"award-info":[{"award-number":["KC-252511650"]}],"id":[{"id":"10.13039\/501100007839","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.cor.2026.107468","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T06:26:02Z","timestamp":1773728762000},"page":"107468","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Cost-sharing mechanisms for the selfish maximum open-end bin packing problem"],"prefix":"10.1016","volume":"191","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2765-6964","authenticated-orcid":false,"given":"Zhikang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107468_b1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2013.05.041","article-title":"Selfish bin packing with cardinality constraints","volume":"495","author":"Adar","year":"2013","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.cor.2026.107468_b2","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","article-title":"The price of stability for network design with fair cost allocation","volume":"38","author":"Anshelevich","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cor.2026.107468_b3","series-title":"Proc. of the 26th Annual European Symposium on Algorithms (ESA 2018)","first-page":"5:1","article-title":"A new and improved algorithm for online bin packing","author":"Balogh","year":"2018"},{"issue":"7","key":"10.1016\/j.cor.2026.107468_b4","doi-asserted-by":"crossref","first-page":"2047","DOI":"10.1007\/s00453-021-00818-7","article-title":"A new lower bound for classic online bin packing","volume":"83","author":"Balogh","year":"2021","journal-title":"Algorithmica"},{"issue":"11","key":"10.1016\/j.cor.2026.107468_b5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2026.107468_b6","series-title":"Proc. of the 20th International Parallel and Distributed Processing Symposium(IPDPS2006)","first-page":"45","article-title":"On the packing of selfish items","author":"Bil\u00f2","year":"2006"},{"issue":"3","key":"10.1016\/j.cor.2026.107468_b7","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s10878-020-00599-9","article-title":"Selfish colorful bin packing games","volume":"40","author":"Bil\u00f2","year":"2020","journal-title":"J. Comb. Optim."},{"issue":"50","key":"10.1016\/j.cor.2026.107468_b8","doi-asserted-by":"crossref","first-page":"7049","DOI":"10.1016\/j.tcs.2011.09.017","article-title":"Selfish bin covering","volume":"412","author":"Cao","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.cor.2026.107468_b9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/s10878-019-00476-0","article-title":"An improved mechanism for selfish bin packing","volume":"42","author":"Chen","year":"2021","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cor.2026.107468_b10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","article-title":"Approximation and online algorithms for multidimensional bin packing: A survey","volume":"24","author":"Christensen","year":"2017","journal-title":"Comput. Sci. Rev."},{"key":"10.1016\/j.cor.2026.107468_b11","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.ipl.2019.06.002","article-title":"A new lower bound on the price of anarchy of selfish bin packing","volume":"150","author":"D\u00f3sa","year":"2019","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.cor.2026.107468_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.disopt.2019.100556","article-title":"Quality of equilibria for selfish bin packing with cost sharing variants","volume":"38","author":"D\u00f3sa","year":"2020","journal-title":"Discrete Optim."},{"issue":"1","key":"10.1016\/j.cor.2026.107468_b13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.ejor.2019.04.026","article-title":"Using weight decision for decreasing the price of anarchy in selfish bin packing games","volume":"278","author":"D\u00f3sa","year":"2019","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107468_b14","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.dam.2022.07.003","article-title":"Open-end bin packing: new and old analysis approaches","volume":"321","author":"Epstein","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2026.107468_b15","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/s00453-009-9348-6","article-title":"Selfish bin packing","volume":"60","author":"Epstein","year":"2011","journal-title":"Algorithmica"},{"issue":"9","key":"10.1016\/j.cor.2026.107468_b16","doi-asserted-by":"crossref","first-page":"2952","DOI":"10.1007\/s00453-021-00849-0","article-title":"Selfish vector packing","volume":"83","author":"Epstein","year":"2021","journal-title":"Algorithmica"},{"key":"10.1016\/j.cor.2026.107468_b17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00453-014-9942-0","article-title":"Parametric packing of selfish items and the subset sum algorithm","volume":"74","author":"Epstein","year":"2016","journal-title":"Algorithmica"},{"key":"10.1016\/j.cor.2026.107468_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107209","article-title":"Two-dimensional bin packing, cutting stock, and open dimension problems: A survey of practical requirements","volume":"183","author":"Francescatto","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107468_b19","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1007\/s11590-021-01782-5","article-title":"Selfish bin packing under harmonic mean cost sharing mechanism","volume":"16","author":"Gai","year":"2022","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cor.2026.107468_b20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129054125400039","article-title":"On open-end bin packing games","author":"Gai","year":"2025","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.cor.2026.107468_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114276","article-title":"Selfish bin packing with punishment","volume":"982","author":"Gai","year":"2024","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.cor.2026.107468_b22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","article-title":"Worst-case equilibria","volume":"3","author":"Koutsoupias","year":"2009","journal-title":"Comput. Sci. Rev."},{"issue":"4","key":"10.1016\/j.cor.2026.107468_b23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/jos.75","article-title":"A note on an open-end bin packing problem","volume":"4","author":"Leung","year":"2001","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2026.107468_b24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s10878-024-01239-2","article-title":"New bounds on the price of anarchy of selfish bin packing with partial punishment","volume":"49","author":"Li","year":"2025","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cor.2026.107468_b25","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1007\/s10898-012-9856-9","article-title":"A note on a selfish bin packing problem","volume":"56","author":"Ma","year":"2013","journal-title":"J. Global Optim."},{"key":"10.1016\/j.cor.2026.107468_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106860","article-title":"Classification and evaluation of the algorithms for vector bin packing","volume":"173","author":"Mommessin","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107468_b27","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1007\/s10878-017-0201-6","article-title":"Bin packing game with a price of anarchy of 32","volume":"35","author":"Nong","year":"2018","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cor.2026.107468_b28","doi-asserted-by":"crossref","DOI":"10.1142\/S1793830919500228","article-title":"A bin packing game with cardinality constraints under the best cost rule","volume":"11","author":"Nong","year":"2019","journal-title":"Discrete Math. Algorithms Appl."},{"key":"10.1016\/j.cor.2026.107468_b29","series-title":"Proc. of the 19th International Conference on Web and Internet Economics (WINE2023)","first-page":"710","article-title":"Best cost-sharing rule design for selfish bin packing","author":"Wang","year":"2023"},{"key":"10.1016\/j.cor.2026.107468_b30","series-title":"Proc. of the 4th International Workshop on Internet and Network Economics (WINE2008)","first-page":"446","article-title":"Bin packing of selfish items","author":"Yu","year":"2008"},{"key":"10.1016\/j.cor.2026.107468_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105826","article-title":"Adaptive simulated annealing with greedy search for the circle bin packing problem","volume":"144","author":"Yuan","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107468_b32","first-page":"60","article-title":"Cost-sharing mechanisms for the selfish open-end bin packing problem","volume":"vol. 15179","author":"Zhang","year":"2024"},{"issue":"3","key":"10.1016\/j.cor.2026.107468_b33","doi-asserted-by":"crossref","first-page":"1578","DOI":"10.1007\/s10878-019-00519-6","article-title":"From packing rules to cost-sharing mechanisms","volume":"44","author":"Zhang","year":"2022","journal-title":"J. Comb. Optim."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000869?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000869?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:16:12Z","timestamp":1776104172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":33,"alternative-id":["S0305054826000869"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107468","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cost-sharing mechanisms for the selfish maximum open-end bin packing problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107468","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107468"}}