{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:42Z","timestamp":1740099282132,"version":"3.37.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030054526"},{"type":"electronic","value":"9783030054533"}],"license":[{"start":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T00:00:00Z","timestamp":1546128000000},"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-05453-3_1","type":"book-chapter","created":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T21:02:29Z","timestamp":1546117349000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Unified Comparative Study of Heuristic Algorithms for Double Combinatorial Auctions: Locality-Constrained Resource Allocation Problems"],"prefix":"10.1007","author":[{"given":"Diana","family":"Gudu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Hardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Achim","family":"Streit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,30]]},"reference":[{"key":"1_CR1","unstructured":"Smith, D.M.: Predicts 2017: cloud computing enters its second decade. Gartner Special Report (2017)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1147\/sj.431.0032","volume":"43","author":"MA Rappa","year":"2004","unstructured":"Rappa, M.A.: The utility business model and the future of computing services. IBM Syst. J. 43, 32\u201342 (2004). \nhttps:\/\/doi.org\/10.1147\/sj.431.0032","journal-title":"IBM Syst. J."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries De","year":"2003","unstructured":"De Vries, S., Vohra, R.V.: Combinatorial auctions: a survey. INFORMS J. Comput. 15, 284\u2013309 (2003). \nhttps:\/\/doi.org\/10.1287\/ijoc.15.3.284.16077","journal-title":"INFORMS J. Comput."},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Buyya, R., Yeo, C.S., Venugopal, S.: Market-oriented cloud computing: vision, hype, and reality for delivering it services as computing utilities. In: 2008 10th IEEE International Conference on High Performance Computing and Communications. HPCC 2008, pp. 5\u201313. IEEE (2008). \nhttps:\/\/doi.org\/10.1109\/HPCC.2008.172","DOI":"10.1109\/HPCC.2008.172"},{"key":"1_CR5","unstructured":"Amazon: Amazon EC2 pricing (2017). \nhttps:\/\/aws.amazon.com\/ec2\/pricing\n\n. Accessed 3 Nov 2018"},{"key":"1_CR6","first-page":"548","volume":"99","author":"Y Fujishima","year":"1999","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. IJCAI 99, 548\u2013553 (1999)","journal-title":"IJCAI"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TPDS.2014.2308224","volume":"26","author":"MM Nejad","year":"2015","unstructured":"Nejad, M.M., Mashayekhy, L., Grosu, D.: Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. IEEE Trans. Parallel Distrib. Syst. 26, 594\u2013603 (2015). \nhttps:\/\/doi.org\/10.1109\/TPDS.2014.2308224","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D Lehmann","year":"2002","unstructured":"Lehmann, D., O\u0107allaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM (JACM) 49, 577\u2013602 (2002). \nhttps:\/\/doi.org\/10.1145\/585265.585266","journal-title":"J. ACM (JACM)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45153-6_6","volume-title":"Advances in Artificial Intelligence","author":"RC Holte","year":"2001","unstructured":"Holte, R.C.: Combinatorial auctions, knapsack problems, and hill-climbing search. In: Stroulia, E., Matwin, S. (eds.) AI 2001. LNCS (LNAI), vol. 2056, pp. 57\u201366. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45153-6_6"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: Proceedings of the 3rd ACM Conference on Electronic Commerce, pp. 125\u2013136. ACM (2001). \nhttps:\/\/doi.org\/10.1145\/501158.501172","DOI":"10.1145\/501158.501172"},{"key":"1_CR11","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: AAAI\/IAAI, pp. 22\u201329 (2000)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4, 63\u201386 (1998). \nhttps:\/\/doi.org\/10.1023\/A:1009642405419","journal-title":"J. Heuristics"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Khuri, S., B\u00e4ck, T., Heitk\u00f6tter, J.: The zero\/one multiple knapsack problem and genetic algorithms. In: Proceedings of the 1994 ACM Symposium on Applied Computing, pp. 188\u2013193. ACM (1994). \nhttps:\/\/doi.org\/10.1145\/326619.326694","DOI":"10.1145\/326619.326694"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1080\/02331939508844072","volume":"33","author":"M Bertocchi","year":"1995","unstructured":"Bertocchi, M., Butti, A., S\u0142omi\u00f1 ski, L., Sobczynska, J.: Probabilistic and deterministic local search for solving the binary multiknapsack problem. Optimization 33, 155\u2013166 (1995). \nhttps:\/\/doi.org\/10.1080\/02331939508844072","journal-title":"Optimization"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Gudu, D., Zachmann, G., Hardt, M., Streit, A.: Approximate algorithms for double combinatorial auctions for resource allocation in clouds: an empirical comparison. In: Proceedings of the 10th International Conference on Agents and Artificial Intelligence - ICAART, INSTICC, vol. 1, pp. 58\u201369. SciTePress (2018). \nhttps:\/\/doi.org\/10.5220\/0006593900580069","DOI":"10.5220\/0006593900580069"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 66\u201376. ACM (2000). \nhttps:\/\/doi.org\/10.1145\/352871.352879","DOI":"10.1145\/352871.352879"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.7551\/mitpress\/9780262033428.003.0013","volume-title":"Combinatorial Auctions","author":"Daniel Lehmann","year":"2005","unstructured":"Lehmann, D., M\u00fcller, R., Sandholm, T.: The winner determination problem. In: Combinatorial Auctions, pp. 297\u2013318 (2006). \nhttps:\/\/doi.org\/10.7551\/mitpress\/9780262033428.003.0013"},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1145\/1753171.1753181","volume-title":"Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations","author":"Y Shoham","year":"2008","unstructured":"Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, Cambridge (2008). \nhttps:\/\/doi.org\/10.1145\/1753171.1753181"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2006.05.049","volume":"187","author":"B Schnizler","year":"2008","unstructured":"Schnizler, B., Neumann, D., Veit, D., Weinhardt, C.: Trading grid services-a multi-attribute combinatorial approach. Eur. J. Oper. Res. 187, 943\u2013961 (2008). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2006.05.049","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"RB Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29, 265\u2013281 (1983). \nhttps:\/\/doi.org\/10.1016\/0022-0531(83)90048-0","journal-title":"J. Econ. Theory"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1017\/CBO9780511800481.011","volume":"9","author":"N Nisan","year":"2007","unstructured":"Nisan, N., et al.: Introduction to mechanism design (for computer scientists). Algorithmic Game Theory 9, 209\u2013242 (2007)","journal-title":"Algorithmic Game Theory"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-77903-2_24","volume-title":"Operations Research Proceedings 2007","author":"J Pfeiffer","year":"2008","unstructured":"Pfeiffer, J., Rothlauf, F.: Greedy heuristics and weight-coded eas for multidimensional knapsack problems and multi-unit combinatorial auctions. In: Kalcsics, J., Nickel, S. (eds.) Operations Research Proceedings 2007, pp. 153\u2013158. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77903-2_24"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Gonen, R., Lehmann, D.: Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics. In: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 13\u201320. ACM (2000). \nhttps:\/\/doi.org\/10.1145\/352871.352873","DOI":"10.1145\/352871.352873"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60\u2013100 (1991). \nhttps:\/\/doi.org\/10.1137\/1033004","journal-title":"SIAM Rev."},{"key":"1_CR25","unstructured":"IBM: ILOG CPLEX 12.6.3 (2017). \nhttp:\/\/www-03.ibm.com\/software\/products\/en\/ibmilogcpleoptistud\n\n. Accessed 3 Nov 2018"},{"key":"1_CR26","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Greedy algorithms. In: Introduction to Algorithms, vol. 1, pp. 329\u2013355 (2001)"},{"key":"1_CR27","unstructured":"Russell, S., Norvig, P.: Beyond classical search. In: Artificial Intelligence, A Modern Approach, pp. 125\u2013128 (2010)"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., et al.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983). \nhttps:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T Sandholm","year":"2002","unstructured":"Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. Artif. Intell. 135, 1\u201354 (2002). \nhttps:\/\/doi.org\/10.1016\/S0004-3702(01)00159-X","journal-title":"Artif. Intell."},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-1-4614-6940-7_15","volume-title":"Search Methodologies","author":"Kalyanmoy Deb","year":"2013","unstructured":"Deb, K.: Multi-objective optimization. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 403\u2013449 (2014). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-6940-7_15"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05453-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T21:02:39Z","timestamp":1546117359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05453-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,30]]},"ISBN":["9783030054526","9783030054533"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05453-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,30]]},"assertion":[{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Funchal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"16 January 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2018","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":"icaart2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaart.org\/?y=2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26 Posters","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}