{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:36:57Z","timestamp":1725993417824},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811327117"},{"type":"electronic","value":"9789811327124"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-2712-4_6","type":"book-chapter","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T15:37:15Z","timestamp":1537889835000},"page":"80-92","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Interest-Matrix-Based Mechanism for\u00a0Selfish Bin Packing"],"prefix":"10.1007","author":[{"given":"Xia","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V.: On the packing of selfish items. In: Proceedings 20th IEEE International Parallel & Distributed Processing Symposium. IEEE (2006)","DOI":"10.1109\/IPDPS.2006.1639283"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-71147-8_17","volume-title":"Combinatorial Optimization and Applications","author":"X Chen","year":"2017","unstructured":"Chen, X., Nong, Q., Fang, Q.: An improved mechanism for selfish bin packing. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 241\u2013257. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_17"},{"key":"6_CR3","unstructured":"D\u00f3sa, G., Epstein, L.: Generalized selfish bin packing. arXiv preprint arXiv:1202.4080 (2012)"},{"issue":"2","key":"6_CR4","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(2), 368\u2013394 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR5","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(1), 177\u2013207 (2016)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"6_CR7","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_CR8","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.: A note on a selfish bin packing problem. J. Glob. Optim. 56(4), 1457\u20131462 (2013)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"John Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 286\u2013295 (1951)","journal-title":"The Annals of Mathematics"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s10878-017-0201-6","volume":"35","author":"QQ Nong","year":"2018","unstructured":"Nong, Q.Q., Sun, T., Cheng, T.C.E., Fang, Q.Z.: Bin packing game with a price of anarchy 3\/2. J. Comb. Optim. 35(2), 632\u2013640 (2018)","journal-title":"J. Comb. Optim."},{"key":"6_CR12","volume-title":"Selfish Routing and the Price of Anarchy","author":"T Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"6_CR13","unstructured":"Ulman, J.D.: The performance of a memory allocation algorithm. Technical report 100, Princeton University, Princeton NJ (1971)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Wang, Z., Han, X., D\u00f3sa, G., et al.: A general bin packing game: interest taken into account. Algorithmica 1\u201322 (2017)","DOI":"10.1007\/s00453-017-0361-x"},{"key":"6_CR15","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"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2712-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T21:01:05Z","timestamp":1571950865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2712-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811327117","9789811327124"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2712-4_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/nctcs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}