{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:45Z","timestamp":1725562605685},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540214595"},{"type":"electronic","value":"9783540246947"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","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-24694-7_37","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T17:40:16Z","timestamp":1280770816000},"page":"362-369","source":"Crossref","is-referenced-by-count":0,"title":["A Faster Optimal Allocation Algorithm in Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Jin-Woo","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Bong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer Programming for Combinatorial Auction Winner Determination. In: Proceedings of the Fourth International Conference on Multi Agent Systems (ICMAS), pp. 39\u201346 (2000)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1016\/0167-7187(96)01014-4","volume":"14","author":"P.J. Brewer","year":"1996","unstructured":"Brewer, P.J., Plott, C.R.: A Binary Conflict Ascending Price (BICAP) Mechanism for the Decentralized Allocation of the Right to Use Railroad Tracks. Int.Journal of Industrial Organization\u00a014, 857\u2013886 (1996)","journal-title":"Int.Journal of Industrial Organization"},{"volume-title":"Market-Based Control: a Paradigm for Distributed Resource Allocation","year":"1996","key":"37_CR3","unstructured":"Clearwater, S.H. (ed.): Market-Based Control: a Paradigm for Distributed Resource Allocation. World Scientific, Singapore (1996)"},{"key":"37_CR4","unstructured":"de Vries, S., Vohra, R.: Combinatorial Auctions: A Survey. Draft (2000)"},{"key":"37_CR5","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence(IJCAI), pp. 548\u2013553 (1999)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Gonen, R., Lehmann, D.: Linear Programming Helps Solving Large Multi-unit Combinatorial Auctions. In: Electronic Market Design Workshop, July 11-13 (2001)","DOI":"10.1145\/352871.352873"},{"key":"37_CR7","unstructured":"Lazar, A., Semret, N.: The Progressive Second Price Auction Mechanism for Network Resource Sharing. In: 8th International Symposium on Dynamic Games, Maastricht, The Netherlands, July 5-8 (1998)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1086\/262118","volume":"108","author":"P. Milgrom","year":"2000","unstructured":"Milgrom, P.: Putting Auction Theory to Work: The Simultaneous Ascending Auction. Journal of Political Economy\u00a0108, 245\u2013272 (2000)","journal-title":"Journal of Political Economy"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and Allocation in Combinatorial Auctions. In: ACM Conference on Electronic Commerce, pp. 1\u201312 (2000)","DOI":"10.1145\/352871.352872"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2307\/3003463","volume":"13","author":"S.J. Rassenti","year":"1982","unstructured":"Rassenti, S.J., Smith, V.L., Bulfin, R.L.: A combinatorial Auction Mechanism for Airport Time Slot Allocation. Bell Journal of Economics\u00a013, 402\u2013417 (1982)","journal-title":"Bell Journal of Economics"},{"issue":"8","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M.H. Rothkopf","year":"1995","unstructured":"Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally Manageable Combinatorial Auctions. Management Science\u00a044(8), 1131\u20131147 (1995)","journal-title":"Management Science"},{"key":"37_CR12","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 1102\u20131108 (2001)"},{"key":"37_CR13","volume-title":"Some Tractable Combinatorial Auctions","author":"M. Tennenholtz","year":"2000","unstructured":"Tennenholtz, M.: Some Tractable Combinatorial Auctions. AAAI, Menlo Park (2000)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Zurel, E., Nisan, N.: An Efficient Approximate Allocation Algorithm for Combinatorial Auctions. In: ACM Conference on Electronic Commerce, pp. 125\u2013136 (2001)","DOI":"10.1145\/501158.501172"},{"issue":"1-2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0004-3702(03)00015-8","volume":"145","author":"T. Sandholm","year":"2003","unstructured":"Sandholm, T., Suri, S.: BOB: Improved Winner Determination in Combinatorial Auctions and Generalizations. Artificial Intelligence\u00a0145(1-2), 33\u201358 (2003)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","MICAI 2004: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24694-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T14:33:39Z","timestamp":1685716419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24694-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540214595","9783540246947"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24694-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}