{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:25:56Z","timestamp":1743081956486,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030133412"},{"type":"electronic","value":"9783030133429"}],"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-13342-9_2","type":"book-chapter","created":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T03:24:16Z","timestamp":1549509856000},"page":"9-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Applying Auctions to Bank Holding Company Software Project Portfolio Selection"],"prefix":"10.1007","author":[{"given":"David S.","family":"Gerstl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,8]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1257\/000282805774670167","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E.: The New York City high school match. Am. Econ. Rev. 95(2), 364\u2013367 (2005)","journal-title":"Am. Econ. Rev."},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1257\/aer.104.5.446","volume":"104","author":"LM Ausubel","year":"2014","unstructured":"Ausubel, L.M., Baranov, O.V.: Market design and the evolution of the combinatorial clock auction. Am. Econ. Rev. 104(5), 446\u2013451 (2014)","journal-title":"Am. Econ. Rev."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., Cramton, P.C., Milgrom, P.R.: The clock-proxy auction: a practical combinatorial auction design. In: Cramton et al. [10], Chap. 5, pp. 115\u2013138","DOI":"10.7551\/mitpress\/9780262033428.003.0006"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2202\/1534-5955.1019","volume":"1","author":"LM Ausubel","year":"2002","unstructured":"Ausubel, L.M., Milgrom, P.R.: Ascending auctions with package bidding. Front. Theor. Econ. 1(1), 1\u201342 (2002)","journal-title":"Front. Theor. Econ."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., Milgrom, P.R.: The lovely but lonely Vickrey auction. In: Cramton et al. [10], Chap. 1, pp. 17\u201340","DOI":"10.7551\/mitpress\/9780262033428.003.0002"},{"issue":"2","key":"2_CR6","first-page":"65","volume":"18","author":"D Avraham","year":"2012","unstructured":"Avraham, D., Selvaggi, P., Vickery, J.I.: A structural view of U.S. bank holding companies. Econ. Policy Rev. 18(2), 65\u201381 (2012)","journal-title":"Econ. Policy Rev."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: Proceedings of the Ninth Conference TARK, pp. 72\u201387. ACM (2003)","DOI":"10.1145\/846241.846250"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli, A., Cacchiani, V., Malaguti, E.: A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J. Comput. 29(3), 457\u2013473 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2007.10.040","volume":"193","author":"J Chen","year":"2009","unstructured":"Chen, J., Askin, R.G.: Project selection, scheduling and resource allocation with time dependent returns. Eur. J. Oper. Res. 193(1), 23\u201334 (2009)","journal-title":"Eur. J. Oper. Res."},{"volume-title":"Combinatorial Auctions","year":"2006","key":"2_CR10","unstructured":"Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions. MIT Press, Boston (2006)"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1110.1024","volume":"60","author":"RW Day","year":"2012","unstructured":"Day, R.W., Cramton, P.: Quadratic core-selecting payment rules for combinatorial auctions. Oper. Res. 60(3), 588\u2013603 (2012)","journal-title":"Oper. Res."},{"key":"2_CR12","unstructured":"2009 executive job market intelligence report. Technical report, ExecuNet (2009)"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"7","key":"2_CR14","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1057\/palgrave.jors.2600767","volume":"50","author":"F Ghasemzadeh","year":"1999","unstructured":"Ghasemzadeh, F., Archer, N., Iyogun, P.: A zero-one model for project portfolio selection and scheduling. J. Oper. Res. Soc. 50(7), 745\u2013755 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.3982\/TE1198","volume":"11","author":"JK Goeree","year":"2016","unstructured":"Goeree, J.K., Lien, Y.: On the impossibility of core-selecting auctions. Theor. Econ. 11(1), 41\u201352 (2016)","journal-title":"Theor. Econ."},{"key":"2_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2003","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24777-7"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-15681-6_9","volume-title":"Economics of Grids, Clouds, Systems, and Services","author":"TA Knoch","year":"2010","unstructured":"Knoch, T.A., Baumg\u00e4rtner, V., Grosveld, F.G., Egger, K.: Approaching the internalization challenge of grid technologies into e-Society by e-Human \u201cGrid\u201d ecology. In: Altmann, J., Rana, O.F. (eds.) GECON 2010. LNCS, vol. 6296, pp. 116\u2013128. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15681-6_9"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1613\/jair.4587","volume":"53","author":"P Krysta","year":"2015","unstructured":"Krysta, P., Telelis, O., Ventre, C.: Mechanisms for multi-unit combinatorial auctions with a few distinct goods. J. Artif. Intell. Res. 53, 721\u2013744 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Lehmann, D., M\u00fcller, R., Sandholm, T.: The winner determination problem. In: Cramton et al. [10], Chap. 12, pp. 297\u2013318","DOI":"10.7551\/mitpress\/9780262033428.003.0013"},{"key":"2_CR20","unstructured":"Leyton-Brown, K., Shoham, Y., Tennenholtz, M.: An algorithm for multi-unit combinatorial auctions. In: AAAI\/IAAI, pp. 56\u201361 (2000)"},{"key":"2_CR21","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9011.001.0001","volume-title":"The Economics of Collusion: Cartels and Bidding Rings","author":"RC Marshall","year":"2012","unstructured":"Marshall, R.C., Marx, L.M.: The Economics of Collusion: Cartels and Bidding Rings. MIT Press, Cambridge (2012)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Meier, I., Tarhan, V.: Corporate investment decision practices and the hurdle rate premium puzzle. In: 2006 Annual Management European Financial Management Association (2006)","DOI":"10.2139\/ssrn.960161"},{"key":"2_CR23","unstructured":"Nisan, N.: Bidding languages. In: Cramton et al. [10], Chap. 9, pp. 215\u2013231"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Parkes, D.: Iterative combinatorial auctions. In: Cramton et al. [10], Chap. 2, pp. 41\u201378","DOI":"10.7551\/mitpress\/9780262033428.003.0003"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-03549-4_19","volume-title":"Financial Cryptography and Data Security","author":"DC Parkes","year":"2009","unstructured":"Parkes, D.C., Rabin, M.O., Thorpe, C.: Cryptographic combinatorial clock-proxy auctions. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 305\u2013324. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03549-4_19"},{"key":"2_CR26","volume-title":"Project Management: Achieving Competitive Advantage","author":"JK Pinto","year":"2010","unstructured":"Pinto, J.K.: Project Management: Achieving Competitive Advantage. Prentice Hall, Upper Saddle River (2010)"},{"key":"2_CR27","volume-title":"Who Gets What\u2014and Why: The New Economics of Matchmaking and Market Design","author":"AE Roth","year":"2015","unstructured":"Roth, A.E.: Who Gets What\u2014and Why: The New Economics of Matchmaking and Market Design. Houghton Mifflin Harcourt, Boston (2015)"},{"issue":"7","key":"2_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1785414.1785427","volume":"53","author":"M Sako","year":"2010","unstructured":"Sako, M.: Outsourcing versus shared services. CACM 53(7), 27\u201329 (2010)","journal-title":"CACM"},{"issue":"7","key":"2_CR29","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1631\/jzus.C0910479","volume":"11","author":"YY Shou","year":"2010","unstructured":"Shou, Y.Y., Huang, Y.L.: Combinatorial auction algorithm for project portfolio selection and scheduling to maximize the net present value. J. Zhejiang Univ. Sci. C 11(7), 562\u2013574 (2010)","journal-title":"J. Zhejiang Univ. Sci. C"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Tenev, A.P., Peeters, R.: Number of bidders and the winner\u2019s curse. Economic Discussion Papers No. 1802, University of Otago (2018). https:\/\/doi.org\/10.1515\/bejeap-2018-0025","DOI":"10.1515\/bejeap-2018-0025"},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1257\/jep.2.1.191","volume":"2","author":"RH Thaler","year":"1988","unstructured":"Thaler, R.H.: Anomalies: the winner\u2019s curse. J. Econ. Perspect. 2(1), 191\u2013202 (1988)","journal-title":"J. Econ. Perspect."},{"issue":"1","key":"2_CR32","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":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-642-13911-6_31","volume-title":"Web Engineering","author":"M Vukovic","year":"2010","unstructured":"Vukovic, M., Laredo, J., Rajagopal, S.: Challenges and experiences in deploying enterprise crowdsourcing service. In: Benatallah, B., Casati, F., Kappel, G., Rossi, G. (eds.) ICWE 2010. LNCS, vol. 6189, pp. 460\u2013467. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13911-6_31"}],"container-title":["Lecture Notes in Computer Science","Economics of Grids, Clouds, Systems, and Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13342-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:01:20Z","timestamp":1710345680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-13342-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030133412","9783030133429"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13342-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 February 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":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"18 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gecon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.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":"40","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":"11","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":"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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"3.5","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)"}}]}}