{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:51:02Z","timestamp":1649119862097},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,4,24]],"date-time":"2014-04-24T00:00:00Z","timestamp":1398297600000},"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":["Inf Syst Front"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10796-014-9491-8","type":"journal-article","created":{"date-parts":[[2014,4,23]],"date-time":"2014-04-23T05:18:43Z","timestamp":1398230323000},"page":"1145-1160","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Addressing the valuation problem in multi-round combinatorial auctions"],"prefix":"10.1007","volume":"17","author":[{"given":"Soumyakanti","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anup K.","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitava","family":"Bagchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,24]]},"reference":[{"issue":"2","key":"9491_CR1","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1287\/isre.1050.0052","volume":"16","author":"G Adomavicius","year":"2005","unstructured":"Adomavicius, G., & Gupta, A. (2005). Toward comprehensive real-time bidder support in iterative combinatorial auctions. Information Systems Research, 16(2), 169\u2013185.","journal-title":"Information Systems Research"},{"key":"9491_CR2","doi-asserted-by":"crossref","unstructured":"Adomavicius, G., Curley, S., Gupta, A., & Sanyal, P. (2012). Effect of information feedback on bidder behavior in continuous combinatorial auctions. Management Science, 58(4), 811\u2013830.","DOI":"10.1287\/mnsc.1110.1443"},{"key":"9491_CR3","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., & Milgrom, P. (2006a). Ascending proxy auctions. (See [12]:79\u201398).","DOI":"10.7551\/mitpress\/9780262033428.003.0004"},{"key":"9491_CR4","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., & Milgrom, P. (2006b). The lovely but lonely Vickrey auction. In Cramton, P., Shoham, Y., & Steinberg, R. (Eds.), Combinatorial auctions (pp. 17-40). Cambridge: The MIT Press.","DOI":"10.7551\/mitpress\/9780262033428.003.0002"},{"key":"9491_CR5","unstructured":"Ausubel, L.M., Cramton, P., & Milgrom, P. (2006). The clock proxy auction: A practical combinatorial auction design. In Cramton, P., Shoham, Y., & Steinberg, R. (Eds.), Combinatorial auctions (pp. 115\u2013138). Cambridge: The MIT Press."},{"key":"9491_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2555648","volume":"20","author":"J Banks","year":"1989","unstructured":"Banks, J., Ledyard, J. O., & Porter, D. (1989). Allocating uncertain and unresponsive resources: an experimental approach. RAND Journal of Economics, 20, 1\u201325.","journal-title":"RAND Journal of Economics"},{"key":"9491_CR7","author":"S Barkakati","year":"2013","unstructured":"Barkakati, S., & Zeineddine, H. (2013). On achieving secure collaboration in supply chains. Information Systems Frontiers. doi: 10.1007\/s10796-013-9448-3 .","journal-title":"Information Systems Frontiers"},{"issue":"1","key":"9491_CR8","first-page":"39","volume":"2","author":"C Brunner","year":"2010","unstructured":"Brunner, C., Goeree, J. K., Holt, C. A., & Ledyard, J. O. (2010). An experimental test of flexible combinatorial spectrum auction formats. American Economic Journal: Microeconomics, 2(1), 39\u201357.","journal-title":"American Economic Journal: Microeconomics"},{"key":"9491_CR9","unstructured":"Caplice, C., & Sheffi, Y. (2006). Combinatorial auctions for truckload transportation. In Cramton, P., Shoham, Y., & Steinberg, R. (Eds.), Combinatorial auctions (pp. 539\u2013571). Cambridge: The MIT Press."},{"key":"9491_CR10","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Sen, A.K., & Bagchi, A. (2008). Bidder valuation of packages in combinatorial auctions. 41st Annual Hawaii International Conference on System Sciences (HICSS 2008), Hawaii, USA.","DOI":"10.1109\/HICSS.2008.74"},{"key":"9491_CR11","unstructured":"Chakraborty, S., Sen, A.K., & Bagchi, A. (2009). Revaluation of packages by bidders in combinatorial auctions. 42nd Annual Hawaii International Conference on System Sciences (HICSS 2009), Hawaii, USA."},{"issue":"2","key":"9491_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10796-010-9249-x","volume":"14","author":"AS Chang","year":"2012","unstructured":"Chang, A. S. (2012). Time dynamics of overlapping e-auction mechanisms: information transfer, strategic user behavior and auction revenue. Information Systems Frontiers, 14(2), 331\u2013342.","journal-title":"Information Systems Frontiers"},{"key":"9491_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E. H. (1971). Multipart pricing of public goods. Public Choice, 11, 17\u201333.","journal-title":"Public Choice"},{"key":"9491_CR14","volume-title":"Valuation","author":"T Copeland","year":"2000","unstructured":"Copeland, T., Koller, T., & Murrin, J. (2000). Valuation. New York: Wiley."},{"key":"9491_CR15","unstructured":"Cramton, P. (2006). Simultaneous ascending auctions. In Cramton, P., Shoham, Y., & Steinberg, R. (Eds.), Combinatorial auctions (pp. 99\u2013114). Cambridge: The MIT Press."},{"key":"9491_CR16","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.dss.2007.09.002","volume":"44","author":"RW Day","year":"2008","unstructured":"Day, R. W., & Raghavan, S. (2008). A combinatorial procurement auction featuring bundle price revelation without free-riding. Decision Support Systems, 44, 621\u2013640.","journal-title":"Decision Support Systems"},{"key":"9491_CR17","unstructured":"Goeree, J.O., Holt, A.C., & Ledyard, J.O. (2006). An experimental comparison of the FCC\u2019s combinatorial and non-combinatorial simultaneous multiple round auctions. Report for Wireless Telecommunications Bureau of the Federal Communications Commission (FCC)."},{"key":"9491_CR18","doi-asserted-by":"crossref","unstructured":"Greewald, A., & Boyan, J. (2001). Bidding algorithms for simultaneous auctions: A case study. ACM Conference on Electronic Commerce (EC-01).","DOI":"10.1145\/501158.501171"},{"key":"9491_CR19","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T. (1973). Incentives in teams. Econometrica, 41, 617\u2013631.","journal-title":"Econometrica"},{"key":"9491_CR20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0167-9236(02)00004-0","volume":"34","author":"JL Jones","year":"2002","unstructured":"Jones, J. L., & Koehler, G. J. (2002). Combinatorial auction using rule-based bids. Decision Support Systems, 34, 59\u201374.","journal-title":"Decision Support Systems"},{"key":"9491_CR21","first-page":"160","volume":"2","author":"JH Kagel","year":"2010","unstructured":"Kagel, J. H., Lien, Y., & Milgrom, P. (2010). Ascending prices and package bidding: a theoretical and experimental analysis. American Economic Journal: Microeconomics, 2, 160\u2013185.","journal-title":"American Economic Journal: Microeconomics"},{"key":"9491_CR22","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.46.4.586.12054","volume":"46","author":"F Kelly","year":"2000","unstructured":"Kelly, F., & Steinberg, R. (2000). A combinatorial auction with multiple winners for universal service. Management Science, 46, 586\u2013596.","journal-title":"Management Science"},{"key":"9491_CR23","doi-asserted-by":"crossref","DOI":"10.1515\/9780691186290","volume-title":"Auctionsm, theory and practice","author":"P Klemperer","year":"2004","unstructured":"Klemperer, P. (2004). Auctionsm, theory and practice. Princeton: Princeton University Press."},{"key":"9491_CR24","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.dss.2009.07.001","volume":"48","author":"M Koksalan","year":"2009","unstructured":"Koksalan, M., Leskela, R., Wallenius, H., & Wallenius, J. (2009). Improving efficiency in multiple-unit combinatorial auctions: bundling bids from multiple bidders. Decision Support Systems, 48, 103\u2013111.","journal-title":"Decision Support Systems"},{"key":"9491_CR25","volume-title":"Auction theory","author":"V Krishna","year":"2002","unstructured":"Krishna, V. (2002). Auction theory. London: Academic."},{"issue":"3","key":"9491_CR26","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/mnsc.1040.0334","volume":"51","author":"AM Kwasnica","year":"2005","unstructured":"Kwasnica, A. M., Ledyard, J. O., Porter, D., & Demartini, C. (2005). A new and improved design for multiobject iterative auctions. Management Science, 51(3), 419\u2013434.","journal-title":"Management Science"},{"issue":"5","key":"9491_CR27","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/inte.32.5.4.30","volume":"32","author":"JO Ledyard","year":"2002","unstructured":"Ledyard, J. O., Olson, M., Porter, D., Swanson, J. A., & Torma, D. P. (2002). The first use of a combined value auction for transportation services. Interfaces, 32(5), 4\u201312.","journal-title":"Interfaces"},{"issue":"3","key":"9491_CR28","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10796-008-9094-3","volume":"11","author":"C Lee","year":"2009","unstructured":"Lee, C., Ho, P., & Hwang, M. (2009). A secure e-auction scheme based on group signatures. Information Systems Frontiers, 11(3), 335\u2013343.","journal-title":"Information Systems Frontiers"},{"key":"9491_CR29","unstructured":"Lehmann, D., Muller, R., & Sandholm, T. (2006). The winner determination problem. In Cramton, P., Shoham, Y., & Steinberg, R. (Eds.), Combinatorial auctions (pp. 297\u2013318). Cambridge: The MIT Press."},{"key":"9491_CR30","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.dss.2006.10.009","volume":"43","author":"R Leskela","year":"2007","unstructured":"Leskela, R., Teich, J., Wallenius, H., & Wallenius, J. (2007). Decision support for multi-unit combinatorial bundle auctions. Decision Support Systems, 43, 420\u2013434.","journal-title":"Decision Support Systems"},{"key":"9491_CR31","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., et al. (2000). Towards a universal test suite for combinatorial auction algorithms. ACM Conference on Electronic Commerce: 66\u201376.","DOI":"10.1145\/352871.352879"},{"key":"9491_CR32","doi-asserted-by":"crossref","unstructured":"Parkes, D.C. (1999). iBundle: An efficient ascending price package auction. Electronic Commerce.","DOI":"10.1145\/336992.337032"},{"key":"9491_CR33","doi-asserted-by":"crossref","first-page":"11153","DOI":"10.1073\/pnas.1633736100","volume":"100","author":"D Porter","year":"2003","unstructured":"Porter, D., Rassenti, S., Roopnarine, A., & Smith, V. (2003). Combinatorial auction design. Proceedings of the National Academy of Sciences of the United States of America (PNAS), 100, 11153\u201311157.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America (PNAS)"},{"key":"9491_CR34","doi-asserted-by":"crossref","first-page":"402","DOI":"10.2307\/3003463","volume":"13","author":"SJ Rassenti","year":"1982","unstructured":"Rassenti, S. J., Smith, V. L., & Bulfin, R. L. (1982). A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics, 13, 402\u2013417.","journal-title":"Bell Journal of Economics"},{"key":"9491_CR35","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10796-007-9056-1","volume":"10","author":"HK Sabat","year":"2008","unstructured":"Sabat, H. K. (2008). Spectrum acquisition strategies adopted by wireless carriers in the USA. Information Systems Frontiers, 10, 77\u2013102.","journal-title":"Information Systems Frontiers"},{"key":"9491_CR36","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-9236(99)00066-4","volume":"28","author":"T Sandholm","year":"2000","unstructured":"Sandholm, T. (2000). Approaches to winner determination in combinatorial auctions. Decision Support Systems, 28, 165\u2013176.","journal-title":"Decision Support Systems"},{"key":"9491_CR37","unstructured":"Sandholm, T. (2006). Optimal winner determination algorithms. In Cramton, P., Shoham, Y., & Steinberg, R. (Eds.), Combinatorial Auctions (pp. 337\u2013368). Cambridge: The MIT Press."},{"issue":"1","key":"9491_CR38","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejor.2005.04.023","volume":"175","author":"J Teich","year":"2006","unstructured":"Teich, J., Wallenius, H., Wallenius, J., & Zaitsev, A. (2006). A multi-attribute e-auction mechanism for procurement: theoretical foundations. European Journal of Operational Research, 175(1), 90\u2013100.","journal-title":"European Journal of Operational Research"},{"key":"9491_CR39","doi-asserted-by":"crossref","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. The Journal of Finance, 16, 8\u201337.","journal-title":"The Journal of Finance"},{"key":"9491_CR40","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/352871.352900","volume":"EC-00","author":"WE Walsh","year":"2000","unstructured":"Walsh, W. E., Wellman, M. P., & Ygge, F. (2000). Combinatorial auctions for supply chain formation. ACM Conference on Electronic Commerce, EC-00, 260\u2013269.","journal-title":"ACM Conference on Electronic Commerce"}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-014-9491-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10796-014-9491-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-014-9491-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:57:20Z","timestamp":1648871840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10796-014-9491-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,24]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9491"],"URL":"https:\/\/doi.org\/10.1007\/s10796-014-9491-8","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"value":"1387-3326","type":"print"},{"value":"1572-9419","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,24]]}}}