{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:37:14Z","timestamp":1780054634553,"version":"3.54.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030360269","type":"print"},{"value":"9783030360276","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-36027-6_20","type":"book-chapter","created":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T08:03:04Z","timestamp":1574496184000},"page":"231-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Multi-resource, Multi-unit VCG Auction"],"prefix":"10.1007","author":[{"given":"Liran","family":"Funaro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Orna","family":"Agmon Ben-Yehuda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Assaf","family":"Schuster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,11,24]]},"reference":[{"key":"20_CR1","unstructured":"Agmon Ben-Yehuda, O., Ben-Yehuda, M., Schuster, A., Tsafrir, D.: The resource-as-a-service (RaaS) cloud. In: Proceedings of the 4th USENIX Conference on Hot Topics in Cloud Computing (HotCloud). USENIX Association (2012)"},{"issue":"3","key":"20_CR2","first-page":"16","volume":"1","author":"O Agmon Ben-Yehuda","year":"2013","unstructured":"Agmon Ben-Yehuda, O., Ben Yehuda, M., Schuster, A., Tsafrir, D.: Deconstructing Amazon EC2 spot instance pricing. ACM Trans. Econ. Comput. (TEAC) 1(3), 16 (2013)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"7","key":"20_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/2627422","volume":"57","author":"O Agmon Ben-Yehuda","year":"2014","unstructured":"Agmon Ben-Yehuda, O., Ben-Yehuda, M., Schuster, A., Tsafrir, D.: The rise of RaaS: the resource-as-a-service cloud. Commun. ACM 57(7), 76\u201384 (2014)","journal-title":"Commun. ACM"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Agmon Ben-Yehuda, O., Posener, E., Ben-Yehuda, M., Schuster, A., Mu\u2019alem, A.: Ginseng: market-driven memory allocation. In: Proceedings of the 10th ACM SIGPLAN\/SIGOPS International Conference on Virtual Execution Environments (VEE), vol. 49. ACM (2014)","DOI":"10.1145\/2576195.2576197"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Agmon Ben-Yehuda, O., Schuster, A., Sharov, A., Silberstein, M., Iosup, A.: ExPERT: Pareto-efficient task replication on grids and a cloud. In: IEEE 26th International Parallel & Distributed Processing Symposium (IPDPS), pp. 167\u2013178. IEEE (2012)","DOI":"10.1109\/IPDPS.2012.25"},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.cor.2004.09.016","volume":"33","author":"MM Akbar","year":"2006","unstructured":"Akbar, M.M., Rahman, M.S., Kaykobad, M., Manning, E.G., Shoja, G.C.: Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Comput. Oper. Res. 33(5), 1259\u20131273 (2006)","journal-title":"Comput. Oper. Res."},{"key":"20_CR7","unstructured":"Bae, J., Beigman, E., Berry, R., Honig, M.L., Vohra, R.: An efficient auction for non concave valuations. In: 9th International Meeting of the Society for Social Choice and Welfare (2008)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Cameron, C., Singer, J.: We are all economists now: economic utility for multiple heap sizing. In: Proceedings of the 9th International Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems PLE, p. 3. ACM (2014)","DOI":"10.1145\/2633301.2633304"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Cortez, E., Bonde, A., Muzio, A., Russinovich, M., Fontoura, M., Bianchini, R.: Resource central: understanding and predicting workloads for improved resource management in large cloud platforms. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 153\u2013167. ACM (2017)","DOI":"10.1145\/3132747.3132772"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feitelson, D.G., Halpern, J.Y., Kupferman, R., Linial, N.: No justified complaints: on fair sharing of multiple resources. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 68\u201375. ACM (2012)","DOI":"10.1145\/2090236.2090243"},{"key":"20_CR13","unstructured":"Funaro, L., Agmon Ben-Yehuda, O., Schuster, A.: Ginseng: market-driven LLC allocation. In: Proceedings of the 2016 USENIX Conference on Usenix Annual Technical Conference, pp. 295\u2013308. USENIX Association (2016)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Funaro, L., Agmon Ben-Yehuda, O., Schuster, A.: Efficient Multi-Resource, Multi-Unit VCG Auction. arXiv e-prints arXiv:1905.09014 , May 2019","DOI":"10.1007\/978-3-030-36027-6_20"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Funaro, L., Agmon Ben-Yehuda, O., Schuster, A.: Stochastic resource allocation. In: Proceedings of the 15th ACM SIGPLAN\/SIGOPS International Conference on Virtual Execution Environments, VEE 2019. USENIX Association, ACM (2019)","DOI":"10.1145\/3313808.3313815"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.11.042","volume":"260","author":"C Gao","year":"2017","unstructured":"Gao, C., Lu, G., Yao, X., Li, J.: An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem. Eur. J. Oper. Res. 260(1), 1\u201311 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.9734\/CJAST\/2018\/40420","volume":"26","author":"F Ghassemi-Tari","year":"2018","unstructured":"Ghassemi-Tari, F., Hendizadeh, H., Hogg, G.L.: Exact solution algorithms for multi-dimensional multiple-choice knapsack problems. Curr. J. Appl. Sci. Technol. 26, 1\u201321 (2018)","journal-title":"Curr. J. Appl. Sci. Technol."},{"key":"20_CR18","first-page":"617","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econ.: J. Econ. Soc. 41, 617\u2013631 (1973)","journal-title":"Econ.: J. Econ. Soc."},{"key":"20_CR19","unstructured":"Hifi, M., Sadfi, S., Sbihi, A.: An exact algorithm for the multiple-choice multidimensional knapsack problem. Cahiers de la Maison des Sciences Economiques b04024, Universit\u00e9 Panth\u00e9on-Sorbonne (Paris 1), March 2004"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-24777-7_16","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Introduction to NP-completeness of knapsack problems. In: Kellerer, H., Pferschy, U., Pisinger, D. (eds.) Knapsack Problems, pp. 483\u2013493. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_16"},{"key":"20_CR21","unstructured":"Lavi, R., Mu\u2019Alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 574\u2013583. IEEE (2003)"},{"issue":"4","key":"20_CR22","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"EL Lawler","year":"1979","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339\u2013356 (1979)","journal-title":"Math. Oper. Res."},{"key":"20_CR23","unstructured":"Lazar, A.A., Semret, N.: Design and analysis of the progressive second price auction for network bandwidth sharing. Telecommun. Syst.\u2014Spec. Issue Netw. Econ. (1999)"},{"key":"20_CR24","unstructured":"Maill\u00e9, P., Tuffin, B.: Multi-bid auctions for bandwidth allocation in communication networks. In: IEEE INFOCOM (2004)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Maille, P., Tuffin, B.: Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks. In: 3rd EuroNGI Conference on Next Generation Internet Networks, pp. 36\u201339. IEEE (2007)","DOI":"10.1109\/NGI.2007.371195"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. J. Artif. Intell. Res. 29, 19\u201347 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR27","unstructured":"Roberts, K.: The characterization of implementable choice rules. In: Aggregation and Revelation of Preferences, vol. 12, no. 2, pp. 321\u2013348 (1979)"},{"issue":"4","key":"20_CR28","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1142\/S0218348X01000816","volume":"9","author":"W Souma","year":"2001","unstructured":"Souma, W.: Universal structure of the personal income distribution. Fractals 9(4), 463\u2013470 (2001)","journal-title":"Fractals"},{"issue":"1","key":"20_CR29","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.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1), 8\u201337 (1961)","journal-title":"J. Finance"},{"key":"20_CR30","unstructured":"Yang, T., Berger, E.D., Kaplan, S.F., Moss, J.E.B.: CRAMM: virtual memory support for garbagecollected applications. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementation, OSDI 2006, pp. 103\u2013116. USENIX Association (2006)"},{"key":"20_CR31","first-page":"1","volume":"45","author":"C Ye","year":"2015","unstructured":"Ye, C., Brock, J., Ding, C., Jin, H.: Rochester elastic cache utility (RECU): unequal cache sharing is good economics. Int. J. Parallel Program. 45, 1\u201315 (2015)","journal-title":"Int. J. Parallel Program."}],"container-title":["Lecture Notes in Computer Science","Economics of Grids, Clouds, Systems, and Services"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36027-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T22:54:25Z","timestamp":1576191265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36027-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030360269","9783030360276"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36027-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GECON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Economics of Grids, Clouds, Systems, and Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gecon2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.gecon-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.33","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.89","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}