{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:01:45Z","timestamp":1764997305076,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["U1866602","11671355"],"award-info":[{"award-number":["U1866602","11671355"]}],"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,11]]},"DOI":"10.1007\/s10878-020-00601-4","type":"journal-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T13:02:41Z","timestamp":1591707761000},"page":"2224-2245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Truthful mechanism design for bin packing with applications on cloud computing"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4764-1847","authenticated-orcid":false,"given":"Deshi","family":"Ye","sequence":"first","affiliation":[]},{"given":"Feng","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,9]]},"reference":[{"key":"601_CR1","unstructured":"Archer A (2004) Mechanisms for discrete optimization with rational agents. Ph.D. thesis, Cornell University"},{"key":"601_CR2","doi-asserted-by":"crossref","unstructured":"Archer A, Tardos E (2001) Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science. IEEE Computer Society, pp 482\u2013491","DOI":"10.1109\/SFCS.2001.959924"},{"key":"601_CR3","doi-asserted-by":"crossref","unstructured":"Bansal N, Elias M, Khan A (2016) Improved approximation for vector bin packing. In: Proceedings of the 27th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM, pp 1561\u20131579","DOI":"10.1137\/1.9781611974331.ch106"},{"issue":"6","key":"601_CR4","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1137\/090772988","volume":"40","author":"P Briest","year":"2011","unstructured":"Briest P, Krysta P, V\u00f6cking B (2011) Approximation techniques for utilitarian mechanism design. SIAM J Comput 40(6):1587\u20131622","journal-title":"SIAM J Comput"},{"key":"601_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri C, Gamzu I (2009) Truthful mechanisms via greedy iterative packing. In: Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Springer, pp 56\u201369","DOI":"10.1007\/978-3-642-03685-9_5"},{"issue":"4","key":"601_CR6","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C Chekuri","year":"2004","unstructured":"Chekuri C, Khanna S (2004) On multidimensional packing problems. SIAM J Comput 33(4):837\u2013851","journal-title":"SIAM J Comput"},{"key":"601_CR7","doi-asserted-by":"crossref","unstructured":"Coffman EG Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: survey and classification. In: Handbook of combinatorial optimization. Springer, pp 455\u2013531","DOI":"10.1007\/978-1-4419-7997-1_35"},{"issue":"4","key":"601_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"WF de La Vega","year":"1981","unstructured":"de La Vega WF, Lueker GS (1981) Bin packing can be solved within 1+ $$\\varepsilon $$ in linear time. Combinatorica 1(4):349\u2013355","journal-title":"Combinatorica"},{"issue":"1","key":"601_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/060670328","volume":"38","author":"L Epstein","year":"2008","unstructured":"Epstein L, Levin A (2008) An aptas for generalized cost variable-sized bin packing. SIAM J Comput 38(1):411\u2013428","journal-title":"SIAM J Comput"},{"issue":"1","key":"601_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"DK Friesen","year":"1986","unstructured":"Friesen DK, Langston MA (1986) Variable sized bin packing. SIAM J Comput 15(1):222\u2013230","journal-title":"SIAM J Comput"},{"key":"601_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10479-015-1973-7","volume":"242","author":"M Gabay","year":"2015","unstructured":"Gabay M, Zaourar S (2015) Vector bin packing with heterogeneous bins: application to the machine reassignment problem. Ann Oper Res 242:161\u2013194","journal-title":"Ann Oper Res"},{"key":"601_CR12","doi-asserted-by":"crossref","unstructured":"Johnson DS (2016) Vector bin packing. In: Encyclopedia of algorithms, pp 2319\u20132323","DOI":"10.1007\/978-1-4939-2864-4_495"},{"issue":"2","key":"601_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(02)00247-3","volume":"147","author":"J Kang","year":"2003","unstructured":"Kang J, Park S (2003) Algorithms for the variable sized bin packing problem. Eur J Oper Res 147(2):365\u2013372","journal-title":"Eur J Oper Res"},{"key":"601_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"issue":"3","key":"601_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/TCC.2014.2369419","volume":"3","author":"L Mashayekhy","year":"2015","unstructured":"Mashayekhy L, Nejad MM, Grosu D (2015a) Physical machine resource management in clouds: a mechanism design approach. IEEE Trans Cloud Comput 3(3):247\u2013260","journal-title":"IEEE Trans Cloud Comput"},{"issue":"9","key":"601_CR16","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2014.2355228","volume":"26","author":"L Mashayekhy","year":"2015","unstructured":"Mashayekhy L, Nejad MM, Grosu D (2015b) A ptas mechanism for provisioning and allocation of heterogeneous cloud resources. IEEE Trans Parallel Distrib Syst 26(9):2386\u20132399","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"601_CR17","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.geb.2007.12.009","volume":"64","author":"A Mu\u2019Alem","year":"2008","unstructured":"Mu\u2019Alem A, Nisan N (2008) Truthful approximation mechanisms for restricted combinatorial auctions. Games Econ Behav 64(2):612\u2013631","journal-title":"Games Econ Behav"},{"issue":"3","key":"601_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0166-218X(88)90069-8","volume":"21","author":"FD Murgolo","year":"1988","unstructured":"Murgolo FD (1988) Anomalous behavior in bin packing algorithms. Discrete Appl Math 21(3):229\u2013243","journal-title":"Discrete Appl Math"},{"key":"601_CR19","doi-asserted-by":"crossref","unstructured":"Nejad MM, Mashayekhy L, Grosu D (2013) A family of truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. In: IEEE CLOUD, pp 188\u2013195","DOI":"10.1109\/CLOUD.2013.14"},{"key":"601_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N Nisan","year":"2007","unstructured":"Nisan N, Ronen A (2007) Computationally feasible VCG mechanisms. J Artif Intell Res (JAIR) 29:19\u201347","journal-title":"J Artif Intell Res (JAIR)"},{"key":"601_CR21","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 VV (2007) Algorithmic game theory, vol 1. Cambridge University Press, Cambridge"},{"key":"601_CR22","unstructured":"Reiss C, Wilkes J, Hellerstein JL (2011) Google cluster-usage traces: format + schema. Technical report, Google Inc., Mountain View, CA, USA, Nov 2011. Revised 2012.03.20. Posted at http:\/\/code.google.com\/p\/googleclusterdata\/wiki\/TraceVersion2"},{"key":"601_CR23","unstructured":"Reiss C, Katz RH, Kozuch MA (2012) Towards understanding heterogeneous clouds at scale: Google trace analysis. ISTC-CC-TR-12-101, Carnegie Mellon University"},{"issue":"9","key":"601_CR24","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1016\/j.jpdc.2010.05.006","volume":"70","author":"M Stillwell","year":"2010","unstructured":"Stillwell M, Schanzenbach D, Vivien F, Casanova H (2010) Resource allocation algorithms for virtualized service hosting platforms. J Parallel Distrib Comput 70(9):962\u2013974","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"601_CR25","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Finance 16(1):8\u201337","journal-title":"J Finance"},{"issue":"6","key":"601_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","volume":"64","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger GJ (1997) There is no asymptotic ptas for two-dimensional vector packing. Inf Process Lett 64(6):293\u2013297","journal-title":"Inf Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00601-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00601-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00601-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:17:05Z","timestamp":1665778625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00601-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,9]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["601"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00601-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,6,9]]},"assertion":[{"value":"9 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}