{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:06:49Z","timestamp":1725574009780},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408086"},{"type":"electronic","value":"9783540452294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45229-4_4","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T00:58:04Z","timestamp":1294361884000},"page":"26-36","source":"Crossref","is-referenced-by-count":1,"title":["A Combinatorial Exchange for Autonomous Traders"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Tanner","sequence":"first","affiliation":[]},{"given":"Gero","family":"M\u00fchl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Deutsche B\u00f6rse Group. Xetra Stock Market Model (2001), http:\/\/www.xetra.de"},{"key":"4_CR2","unstructured":"Deutsche B\u00f6rse Group. Xetra Warrant Market Model (2001), http:\/\/www.xetra.de"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"DeVries, S., Vohra, R.: Combinatorial auctions: A survey. INFORMS Journal on Computing\u00a015 (2003)","DOI":"10.1287\/ijoc.15.3.284.16077"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-45705-4_4","volume-title":"E-Commerce and Web Technologies","author":"S. Kameshwaran","year":"2002","unstructured":"Kameshwaran, S., Narahari, Y.: A new approach to the design of electronic exchanges. In: Bauknecht, K., Tjoa, A.M., Quirchmayr, G. (eds.) EC-Web 2002. LNCS, vol.\u00a02455, pp. 27\u201336. Springer, Heidelberg (2002)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"28","author":"R.B. Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. Journal of Economic Theory\u00a028, 265\u2013281 (1983)","journal-title":"Journal of Economic Theory"},{"key":"4_CR6","unstructured":"Parkes, D.C., Kalagnanam, J., Eso, M.: Achieving budget-balance with vickrey-based payment schemes in exchanges. Technical report, IBM Research Report (March 2002)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M.H. Rothkopf","year":"1998","unstructured":"Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally managable combinatorial auctions. Management Science\u00a044, 1131\u20131147 (1998)","journal-title":"Management Science"},{"key":"4_CR8","unstructured":"Sakurai, Y., Yokoo, M., Matsubara, S.: A limitation of the generalized vickrey auction in electronic commerce. In: Proc. AAAI-1999, Orlando, FL, pp. 86\u201392 (1999)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Winner determination in combinatorial auction generalizations (2001)","DOI":"10.1145\/544741.544760"},{"key":"4_CR10","unstructured":"Sandholm, T., Suri, S.: Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In: AAAI\/IAAI, pp. 90\u201397 (2000)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0167-9236(98)00060-8","volume":"24","author":"P. Wurman","year":"1998","unstructured":"Wurman, P., Walsh, W., Wellman, M.: Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems\u00a024, 17\u201327 (1998)","journal-title":"Decision Support Systems"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Sakurai, Y., Matsubara, S.: The effect of false name declarations in mechanism design: Towards collective decision making on the internet. In: Proc. 20th International Conference on Distributed Computing Systems (ICDCS-2000), pp. 146\u2013153 (2000)","DOI":"10.1109\/ICDCS.2000.840916"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0004-3702(01)00077-7","volume":"130","author":"M. Yokoo","year":"2001","unstructured":"Yokoo, M., Sakurai, Y., Matsubara, S.: Robust combinatorial auction protocol against false-name bids. Artificial Intelligence\u00a0130, 167\u2013181 (2001)","journal-title":"Artificial Intelligence"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/501158.501172","volume-title":"Proceedings of the 3rd ACM conference on Electronic Commerce","author":"E. Zurel","year":"2001","unstructured":"Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: Proceedings of the 3rd ACM conference on Electronic Commerce, pp. 125\u2013136. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","E-Commerce and Web Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45229-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:11:41Z","timestamp":1559913101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45229-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408086","9783540452294"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45229-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}