{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:44:14Z","timestamp":1742931854342,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_46","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"641-654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Incentive Mechanism for Selfish Bin Covering"],"prefix":"10.1007","author":[{"given":"Weian","family":"Li","sequence":"first","affiliation":[]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Wenjing","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"46_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."},{"unstructured":"Assmann, S.B.: Problems in discrete applied mathematics. Ph.D. thesis, Department of Mathematics, MIT, Cambridge, MA (1983)","key":"46_CR2"},{"issue":"4","key":"46_CR3","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"SF Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.-T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V.: On the packing of selfish items. In: Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, p. 9. IEEE (2006)","key":"46_CR4","DOI":"10.1109\/IPDPS.2006.1639283"},{"issue":"50","key":"46_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."},{"issue":"1","key":"46_CR6","first-page":"13","volume":"14","author":"J Csirik","year":"1999","unstructured":"Csirik, J., Frenk, J.B.G., Labb\u00e9, M., Zhang, S.: Two simple algorithms for bin covering. Acta Cybernetica 14(1), 13\u201325 (1999)","journal-title":"Acta Cybernetica"},{"unstructured":"Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 557\u2013566. Society for Industrial and Applied Mathematics (2001)","key":"46_CR7"},{"unstructured":"Coffman, E.G., Csirik, J., Leung, J.Y.-T.: Variants of classical one-dimensional bin packing. In: Handbook of Approximation Algorithms and Metaheuristics, p. 13 (2007). Chap. 33","key":"46_CR8"},{"unstructured":"D\u00f3sa, G., Epstein, L.: Generalized selfish bin packing. arXiv preprint \n                      arXiv:1202.4080\n                      \n                     (2012)","key":"46_CR9"},{"issue":"2","key":"46_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(2), 368\u2013394 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"46_CR11","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0304-3975(03)00363-3","volume":"306","author":"K Jansen","year":"2003","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theoret. Comput. Sci. 306(1), 543\u2013551 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR12","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)"},{"issue":"4","key":"46_CR13","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.: A note on a selfish bin packing problem. J. Global Optim. 56(4), 1457\u20131462 (2013)","journal-title":"J. Global Optim."},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, 749\u2013753. ACM (2001)","key":"46_CR14","DOI":"10.1145\/380752.380883"},{"key":"46_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)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:19:41Z","timestamp":1558477181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/cocoa2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}