{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:52:45Z","timestamp":1654098765855},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Commerce Research and Applications"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s1567-4223(03)00013-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"176-186","source":"Crossref","is-referenced-by-count":7,"title":["Reducing complexity in winner determination for combinatorial ascending auctions"],"prefix":"10.1016","volume":"2","author":[{"given":"Chihiro","family":"Ono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Nishiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Horiuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1567-4223(03)00013-9_BIB1","first-page":"54","article-title":"Autonomous agents for participating in multiple online auctions","author":"Anthony","year":"2001"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB2","doi-asserted-by":"crossref","unstructured":"L. Ausbel, P. Milgrom, Ascending Auctions with Package Bidding, draft paper, Stanford University, 2002.","DOI":"10.2202\/1534-5963.1019"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB3","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0167-7187(96)01014-4","article-title":"A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks","volume":"14","author":"Brewer","year":"1996","journal-title":"International Journal of Industrial Organization"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB4","first-page":"613","article-title":"Decision procedures for multiple auctions","author":"Byde","year":"2002"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB5","article-title":"Taming the computational complexity of combinatorial auctions: optimal and approximate approaches","author":"Fujishjima","year":"1999"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB6","first-page":"399","article-title":"BiddingBot: a multiagent support system for cooperative bidding in multiple auctions","author":"Ito","year":"2000"},{"issue":"3","key":"10.1016\/S1567-4223(03)00013-9_BIB7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1111\/1467-6419.00083","article-title":"Auction theory: a guide to the literature","volume":"13","author":"Klemperer","year":"1999","journal-title":"Journal of Economic Surveys"},{"issue":"1","key":"10.1016\/S1567-4223(03)00013-9_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1257\/jep.10.1.159","article-title":"Analyzing the airwaves auction","volume":"10","author":"McAfee","year":"1996","journal-title":"Journal of Economic Perspectives"},{"issue":"2","key":"10.1016\/S1567-4223(03)00013-9_BIB10","first-page":"699","article-title":"Auctions and bidding","volume":"25","author":"McAfee","year":"1987","journal-title":"Journal of Economic Literature"},{"issue":"3","key":"10.1016\/S1567-4223(03)00013-9_BIB11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1257\/jep.8.3.145","article-title":"Selling spectrum rights","volume":"8","author":"McMillan","year":"1994","journal-title":"Journal of Economic Perspectives"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB12","first-page":"1","article-title":"Bidding and allocation in combinatorial auctions","author":"Nisan","year":"2000"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB13","doi-asserted-by":"crossref","first-page":"402","DOI":"10.2307\/3003463","article-title":"A combinatorial auction mechanism for airport time slot allocation","volume":"13","author":"Rassenti","year":"1982","journal-title":"Bell Journal of Economics"},{"issue":"8","key":"10.1016\/S1567-4223(03)00013-9_BIB14","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","article-title":"Computationally manageable combinatorial auctions","volume":"44","author":"Rothkopf","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB15","doi-asserted-by":"crossref","DOI":"10.1145\/352871.352875","article-title":"An efficient approximate algorithm for winner determination in combinatorial auctions","author":"Sakurai","year":"2000"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB16","first-page":"86","article-title":"A limitation of the generalized Vickrey auction in electronic commerce; robustness against false-name bids","author":"Sakurai","year":"1999"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB17","article-title":"An algorithm for optimal winner determination in combinatorial auctions","author":"Sandholm","year":"1999"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/375735.376301","article-title":"ATTac-2000: an adaptive autonomous bidding agent","author":"Stone","year":"2001"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB19","doi-asserted-by":"crossref","first-page":"8","DOI":"10.2307\/2977633","article-title":"Counterspeculation, auctions and competitive sealed tenders","volume":"16","author":"Vickrey","year":"1961","journal-title":"Journal of Finance"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB20","unstructured":"S.D. Vries, R. Vohra, Combinatorial Auctions: A Survey, draft, 2000."},{"issue":"1\/2","key":"10.1016\/S1567-4223(03)00013-9_BIB21","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1006\/game.2000.0822","article-title":"Auction protocols for decentralized scheduling","volume":"35","author":"Wellman","year":"2001","journal-title":"Games and Economic Behavior"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB22","unstructured":"World Wide Web Consortium, Web Services Activity, http:\/\/www.w3.org\/2002\/ws\/"},{"key":"10.1016\/S1567-4223(03)00013-9_BIB23","first-page":"146","article-title":"The effect of false-name declarations in mechanism design: towards collective decision making on the Internet","author":"Yokoo","year":"2000"}],"container-title":["Electronic Commerce Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567422303000139?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567422303000139?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:21:56Z","timestamp":1584652916000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567422303000139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S1567422303000139"],"URL":"https:\/\/doi.org\/10.1016\/s1567-4223(03)00013-9","relation":{},"ISSN":["1567-4223"],"issn-type":[{"value":"1567-4223","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}