{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:45:23Z","timestamp":1743129923023,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231691"},{"type":"electronic","value":"9783540302339"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30233-9_5","type":"book-chapter","created":{"date-parts":[[2010,10,24]],"date-time":"2010-10-24T12:06:08Z","timestamp":1287921968000},"page":"58-71","source":"Crossref","is-referenced-by-count":0,"title":["A Decomposition Based Approach for Design of Supply Aggregation and Demand Aggregation Exchanges"],"prefix":"10.1007","author":[{"given":"Shantanu","family":"Biswas","sequence":"first","affiliation":[]},{"given":"Y.","family":"Narahari","sequence":"additional","affiliation":[]},{"given":"Anish Das","family":"Sarma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Kalagnanam, J., Parkes, D.: Auctions, bidding, and exchange design. In: Simchi-Levi, Wu, D., Shen (eds.) Supply Chain Analysis in the eBusiness Area. Kluwer Academic Publishers, Dordrecht (2003)","key":"5_CR1","DOI":"10.1007\/978-1-4020-7953-5_5"},{"doi-asserted-by":"crossref","unstructured":"de Vries, S., Vohra, R.: Combinatorial auctions, a survey. INFORMS Journal of Computing15 (2003)","key":"5_CR2","DOI":"10.1287\/ijoc.15.3.284.16077"},{"doi-asserted-by":"crossref","unstructured":"Hunsberger, L., Gross, B.J.: A combinatorial auction for collaborative planning. In: Proceedings International Conference on Multi-Agent Systems (ICMAS 2000), pp. 151\u2013158 (2000)","key":"5_CR3","DOI":"10.1109\/ICMAS.2000.858447"},{"unstructured":"Kameshwaran, S., Narahari, Y.: Innovative auction mechanisms for logistics marketplaces. In: Proceedings of the International Conference on Automation, Energy, and Information Technology, EAIT 2001, Indian Institute of Technology, Kharagpur (2001)","key":"5_CR4"},{"unstructured":"Song, J., Regan, A.C.: Combinatorial auctions for transportation since procurement: The carrier perspective. Technical report, Institutee of Transportation Studies, University of California, Irvine (2002)","key":"5_CR5"},{"unstructured":"Ledyard, J.O., Olson, M., Porter, D., Swanson, J.A., Torma, D.: The first use of a combined value auction for transprotation services. Technical Report 1093, California Institute of Technology (2000)","key":"5_CR6"},{"unstructured":"Eso, M., Kalagnanam, J., Ladanyi, L., Li, Y.: Winner determination in bandwidth exchanges. Technical report, RC22219 (W0110-087), IBM TJ Watson Research Center (2001)","key":"5_CR7"},{"doi-asserted-by":"crossref","unstructured":"Walsh, W.E., Wellman, M.P., Ygge, F.: Combinatorial auctions for supply chain formation. In: ACM Conference on Electronic Commerce, pp. 260\u2013269 (2000)","key":"5_CR8","DOI":"10.1145\/352871.352900"},{"unstructured":"Hohner, G., Rich, J., Ng, E., Reid, G., Davenport, A.J., Kalagnam, J.R., Lee, H.S., An, C.: Combinatorial and quantity discount procurement auctions provide benifits to mars and its suppliers. Technical report, IBM Research Report (2001)","key":"5_CR9"},{"unstructured":"Elmaghraby, W., Keskinocak, P.: Combinatorial auctions in procurement. Technical report, Dept. of Industrial and Systems Engineering, Georgia Institute of Technology (2002)","key":"5_CR10"},{"doi-asserted-by":"crossref","unstructured":"Biswas, S., Narahari, Y.: Iterative Dutch combinatorial auctions. Annals of Mathematics and Artificial Intelligence (2004);","key":"#cr-split#-5_CR11.1","DOI":"10.1007\/s10472-005-4687-8"},{"unstructured":"To appear in the special issue on the Foundations of Electronic Commerce","key":"#cr-split#-5_CR11.2"},{"unstructured":"Narahari, Y., Dayama, P.: Combinatorial auctions in electronic business. Technical report, Electronic Enterprises Laboratory, Department of Computer Science and Automation, Indian Institute of Science (2004)","key":"5_CR12"},{"unstructured":"Smith, T., Sandholm, T., Simmons, R.: Constructing and clearing combinatorial exchanges using preference elicitation. In: Proceedings of National Conference on Artificial Intelligence, AAAI 2002 (2002)","key":"5_CR13"},{"unstructured":"Dayama, P., Narahari, Y.: Design of multi-unit electronic exchanges through decomposition. Technical report, Electronic Enterprises Laboratory, Department of Computer Science and Automation, Indian Institute of Science (2003)","key":"5_CR14"},{"doi-asserted-by":"crossref","unstructured":"Kothari, A., Sandholm, T., Suri, S.: Solving combinatorial exchanges: Optimality via a few partial bids. In: AAAI (2002)","key":"5_CR15","DOI":"10.1145\/779950.779976"},{"unstructured":"Parkes, D.: Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency. PhD thesis, Department of Computer and Information Science, University of Pennsylvania (2001)","key":"5_CR16"},{"unstructured":"Parkes, D.C., Kalagnanam, J., Eso, M.: Achieving budget-balance with Vickreybased payment schemes in exchanges. In: 17th International Joint Conference on Artificial Intelligence, IJCAI 2001 (2001)","key":"5_CR17"},{"unstructured":"Biswas, S.: Iterative Mechanisms for Combinatorial Auctions and Exchanges. PhD thesis, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India (2004)","key":"5_CR18"},{"unstructured":"Bikchandani, S., Ostroy, J.M.: The package assignment model. Technical report, Anderson Graduate School of Management and Department of Economics, UCLA (2001)","key":"5_CR19"},{"unstructured":"Ausubel, L., Cramton, P.: Vickrey auctions with reserve pricing. Technical report, Working Paper, University of Maryland (1999)","key":"5_CR20"},{"unstructured":"Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 542\u2013547 (1999)","key":"5_CR21"},{"unstructured":"Boutilier, C., Goldszmidt, M.B.S.: Sequential auctions for the allocation of resources with complementarities. In: International Joint Conferences on Artificial Intelligence (1999)","key":"5_CR22"},{"doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Mark Pearson, Y.S.: Towards a universal test suite for combinatorial auction algorithm. In: ACM Conference on Electronic Commerce 2000 (2000)","key":"5_CR23","DOI":"10.1145\/352871.352879"}],"container-title":["Lecture Notes in Computer Science","Applying Formal Methods: Testing, Performance, and M\/E-Commerce"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30233-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T17:01:09Z","timestamp":1559754069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30233-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231691","9783540302339"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30233-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}