{"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":1773778385831,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T00:00:00Z","timestamp":1510185600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China (CN)","award":["11201439"],"award-info":[{"award-number":["11201439"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10878-017-0201-6","type":"journal-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T07:00:00Z","timestamp":1510210800000},"page":"632-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Bin packing game with a price of anarchy of $$\\frac{3}{2}$$ 3 2"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0895-7793","authenticated-orcid":false,"given":"Q. Q.","family":"Nong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Q. Z.","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,9]]},"reference":[{"key":"201_CR1","doi-asserted-by":"crossref","unstructured":"Bil\u2019o V (2006) On the packing of selfish items. In: Proceedings of the 20th international parallel and distributed processing symposium (IPDPS 2006), IEEE, New York","DOI":"10.1109\/IPDPS.2006.1639283"},{"key":"201_CR2","unstructured":"D\u2019osa G (2007) The tight bound of First Fit Decreasing bin-packing algorithm is FFD(I) 11\/9OPT(I) + 6\/9. In: Proceedings of 1st international symposium on combinatorics, algorithms, probabilistic and experimental methodologies (ESCAPE). Lecture notes in computer science, vol 4614. Springer, pp 1\u201311"},{"key":"201_CR3","unstructured":"D\u2019osa G, Epstein L (2012) Generalized selfish bin packing. CoRR, arXiv:1202.40809"},{"key":"201_CR4","unstructured":"D\u2019osa G, Sgall J (2013) First Fit bin packing: a tight analysis. In: Proceedings of 30th international symposium on theoretical aspects of computer science (STACS 2013), pp 538\u2013549"},{"key":"201_CR5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/978-3-642-40313-2_2","volume":"8087","author":"L Epstein","year":"2013","unstructured":"Epstein L (2013) Bin packing games with selfish items. Lect Notes Comput Sci 8087:8\u201321","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"201_CR6","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 (2011) Selfish bin packing. Algorithmica 60(2):368\u2013394","journal-title":"Algorithmica"},{"key":"201_CR7","doi-asserted-by":"crossref","unstructured":"Epstein L, Kleiman E, Mestre J (2009) Parametric packing of selfish items and the subset sum algorithm. In: Leonardi S (eds) WINE 2009. Lecture notes in computer science, vol 5929. Springer, Heidelberg, pp 67\u201378","DOI":"10.1007\/978-3-642-10841-9_8"},{"issue":"3","key":"201_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"MR Garey","year":"1976","unstructured":"Garey MR, Graham RL, Johnson DS, Yao ACC (1976) Resource constrained scheduling as generalized bin packing. J Comb Theory Ser A 21(3):257\u2013298","journal-title":"J Comb Theory Ser A"},{"issue":"4","key":"201_CR9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers AJ, 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"},{"key":"201_CR10","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1007\/s10898-012-9856-9","volume":"56","author":"RX Ma","year":"2013","unstructured":"Ma RX, D\u2019osa G, Han X, Ting HF, Ye D, Zhang Y (2013) A note on a selfish bin packing problem. J Glob Optim 56:1457\u20131462","journal-title":"J Glob Optim"},{"key":"201_CR11","unstructured":"Ullman JD (1971) The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton"},{"key":"201_CR12","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 2008. Lecture notes in computer science, vol 5385. Springer, Heidelberg, pp 446\u2013453","DOI":"10.1007\/978-3-540-92185-1_50"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0201-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0201-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0201-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T18:30:26Z","timestamp":1570300226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0201-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0201-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,9]]}}}