{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:27:55Z","timestamp":1743031675742,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777976"},{"type":"electronic","value":"9789819777983"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7798-3_6","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"60-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cost-Sharing Mechanisms for\u00a0the\u00a0Selfish Open-End Bin Packing Problem"],"prefix":"10.1007","author":[{"given":"Zhikang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"6_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.: Selfish bin packing with cardinality constraints. Theoret. Comput. Sci. 495, 66\u201380 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., et al.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V.: On the packing of selfish items. In: IPDPS 2006, Rhodes, Greece, pp. 45\u201354. IEEE (2006). https:\/\/doi.org\/10.1109\/IPDPS.2006.1639283","key":"6_CR3","DOI":"10.1109\/IPDPS.2006.1639283"},{"issue":"3","key":"6_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., et al.: Selfish colorful bin packing games. J. Comb. Optim. 40(3), 610\u2013635 (2020)","journal-title":"J. Comb. Optim."},{"issue":"50","key":"6_CR5","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.: Selfish bin covering. Theoret. Comput. Sci. 412(50), 7049\u20137058 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR6","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.: An improved mechanism for selfish bin packing. J. Comb. Optim. 42, 636\u2013656 (2021)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"6_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.: Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278(1), 160\u2013169 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR8","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.: A new lower bound on the price of anarchy of selfish bin packing. Inf. Process. Lett. 150, 6\u201312 (2019)","journal-title":"Inf. Process. Lett."},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.100556","volume":"38","author":"G D\u00f3sa","year":"2020","unstructured":"D\u00f3sa, G., Epstein, L.: Quality of equilibria for selfish bin packing with cost sharing variants. Discret. Optim. 38, 100556 (2020)","journal-title":"Discret. Optim."},{"key":"6_CR10","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, 368\u2013394 (2011)","journal-title":"Algorithmica"},{"key":"6_CR11","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.: Parametric packing of selfish items and the subset sum algorithm. Algorithmica 74, 177\u2013207 (2016)","journal-title":"Algorithmica"},{"issue":"9","key":"6_CR12","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.: Selfish vector packing. Algorithmica 83(9), 2952\u20132988 (2021)","journal-title":"Algorithmica"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.dam.2022.07.003","volume":"321","author":"L Epstein","year":"2022","unstructured":"Epstein, L.: Open-end bin packing: new and old analysis approaches. Discret. Appl. Math. 321, 220\u2013239 (2022)","journal-title":"Discret. Appl. Math."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-92681-6_8","volume-title":"Combinatorial Optimization and Applications","author":"L Gai","year":"2021","unstructured":"Gai, L., Zhang, W., Luo, W., Cheng, Y.: On various open-end bin packing game. In: Du, D.-Z., Du, D., Wu, C., Xu, D. (eds.) COCOA 2021. LNCS, vol. 13135, pp. 86\u201395. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92681-6_8"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-021-01782-5","volume":"16","author":"L Gai","year":"2022","unstructured":"Gai, L., Wu, C., Xu, D., et al.: Selfish bin packing under Harmonic mean cost sharing mechanism. Optim. Lett. 16, 1\u201312 (2022)","journal-title":"Optim. Lett."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/jos.75","volume":"4","author":"JYT Leung","year":"2001","unstructured":"Leung, J.Y.T., Dror, M., Young, G.H.: A note on an open-end bin packing problem. J. Sched. 4(4), 201\u2013207 (2001)","journal-title":"J. Sched."},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.tcs.2009.10.006","volume":"411","author":"M Lin","year":"2010","unstructured":"Lin, M., Yang, Y., Xu, J.: On lazy bin covering and packing problems. Theoret. Comput. Sci. 411(1), 277\u2013284 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"6_CR19","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., et al.: A note on a selfish bin packing problem. J. Global Optim. 56(4), 1457\u20131462 (2013)","journal-title":"J. Global Optim."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s10878-017-0201-6","volume":"35","author":"Q Nong","year":"2018","unstructured":"Nong, Q., Sun, T., Cheng, T.C.E., et al.: Bin packing game with a price of anarchy of $$\\frac{3}{2}$$. J. Comb. Optim. 35, 632\u2013640 (2018)","journal-title":"J. Comb. Optim."},{"issue":"02","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1950022","DOI":"10.1142\/S1793830919500228","volume":"11","author":"Q Nong","year":"2019","unstructured":"Nong, Q., Wang, J., Gong, S., et al.: A bin packing game with cardinality constraints under the best cost rule. Discret. Math. Algorithms Appl. 11(02), 1950022 (2019)","journal-title":"Discret. Math. Algorithms Appl."},{"unstructured":"Wang, C., Zhang, G.: Best Cost-Sharing Rule Design for Selfish Bin Packing. arXiv preprint arXiv:2204.09202 (2022)","key":"6_CR22"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-92185-1_50","volume-title":"Internet and Network Economics","author":"G Yu","year":"2008","unstructured":"Yu, G., Zhang, G.: Bin packing of selfish items. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 446\u2013453. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_50"},{"issue":"3","key":"6_CR24","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.: From packing rules to cost-sharing mechanisms. J. Comb. Optim. 44(3), 1578\u20131593 (2022)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7798-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:58Z","timestamp":1726769158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7798-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819777976","9789819777983"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7798-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}