{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:13:05Z","timestamp":1773778385828,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:00:00Z","timestamp":1578614400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:00:00Z","timestamp":1578614400000},"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":"crossref","award":["11531014"],"award-info":[{"award-number":["11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-019-00519-6","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T14:02:34Z","timestamp":1578664954000},"page":"1578-1593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["From packing rules to cost-sharing mechanisms"],"prefix":"10.1007","volume":"44","author":[{"given":"Chenhao","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1947-7872","authenticated-orcid":false,"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,10]]},"reference":[{"key":"519_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2013.05.041","volume":"495","author":"R Adar","year":"2013","unstructured":"Adar R, Epstein L (2013) Selfish bin packing with cardinality constraints. Theor Comput Sci 495:66\u201380","journal-title":"Theor Comput Sci"},{"key":"519_CR2","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V (2006) On the packing of selfish items. In: Proceedings of 20th international parallel and distributed processing symposium. IEEE","DOI":"10.1109\/IPDPS.2006.1639283"},{"issue":"50","key":"519_CR3","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. Theor Comput Sci 412(50):7049\u20137058","journal-title":"Theor Comput Sci"},{"key":"519_CR4","doi-asserted-by":"crossref","unstructured":"Chen X, Nong Q, Fang Q (2017) An improved mechanism for selfish bin packing. In: International conference on combinatorial optimization and applications. Springer, Berlin, pp 241\u2013257","DOI":"10.1007\/978-3-319-71147-8_17"},{"issue":"4","key":"519_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"WF de La\u00a0Vega","year":"1981","unstructured":"de La\u00a0Vega WF, Lueker GS (1981) Bin packing can be solved within $$1 + \\varepsilon $$ in linear time. Combinatorica 1(4):349\u2013355","journal-title":"Combinatorica"},{"key":"519_CR6","unstructured":"Dosa G, Epstein L (2012) Generalized selfish bin packing. arXiv preprint arXiv:1202.4080"},{"issue":"1","key":"519_CR7","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":"519_CR8","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"},{"issue":"1","key":"519_CR9","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 (2016) Parametric packing of selfish items and the subset sum algorithm. Algorithmica 74(1):177\u2013207","journal-title":"Algorithmica"},{"key":"519_CR10","doi-asserted-by":"crossref","unstructured":"Hoberg R, Rothvoss T (2017) A logarithmic additive integrality gap for bin packing. In: Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 2616\u20132625","DOI":"10.1137\/1.9781611974782.172"},{"issue":"4","key":"519_CR11","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":"3","key":"519_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.2307\/1914280","volume":"43","author":"E Kalai","year":"1975","unstructured":"Kalai E, Smorodinsky M et al (1975) Other solutions to Nash\u2019s bargaining problem. Econometrica 43(3):513\u2013518","journal-title":"Econometrica"},{"key":"519_CR13","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: Proceedings of the 16th annual symposium on theoretical aspects of computer science. Springer, Berlin, pp 404\u2013413","DOI":"10.1007\/3-540-49116-3_38"},{"key":"519_CR14","doi-asserted-by":"crossref","unstructured":"Li W, Fang Q, Liu W (2016) An incentive mechanism for selfish bin covering. In: Proceedings of the 10th international conference on combinatorial optimization and applications. Springer, Berlin, pp 641\u2013654","DOI":"10.1007\/978-3-319-48749-6_46"},{"issue":"4","key":"519_CR15","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 (2013) A note on a selfish bin packing problem. J Glob Optim 56(4):1457\u20131462","journal-title":"J Glob Optim"},{"issue":"2","key":"519_CR16","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s10878-017-0201-6","volume":"35","author":"QQ Nong","year":"2018","unstructured":"Nong QQ, Sun T, Cheng TCE, Fang QZ (2018) Bin packing game with a price of anarchy of $$\\frac{3}{2}$$. J Comb Optim 35(2):632\u2013640","journal-title":"J Comb Optim"},{"key":"519_CR17","unstructured":"Ullman JD (1971) The performance of a memory allocation algorithm. Technical report 100, Princeton University, Princeton, NJ"},{"key":"519_CR18","doi-asserted-by":"crossref","unstructured":"Yu G, Zhang G (2008) Bin packing of selfish items. In: Proceedings of 4th international workshop international workshop on internet and network economics. Springer, Berlin, pp 446\u2013453","DOI":"10.1007\/978-3-540-92185-1_50"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00519-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00519-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00519-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:43:19Z","timestamp":1664354599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00519-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,10]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["519"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00519-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,10]]},"assertion":[{"value":"10 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}