{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:00:39Z","timestamp":1725613239861},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642238567"},{"type":"electronic","value":"9783642238574"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23857-4_33","type":"book-chapter","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T19:46:40Z","timestamp":1316807200000},"page":"332-343","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Auction Negotiation Protocol for Time-Restricted Group Decisions"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Lang","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Fink","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/BF03342722","volume":"3","author":"T. Buer","year":"2010","unstructured":"Buer, T., Pankratz, G.: GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions. BuR - Business Research\u00a03(2), 192\u2013213 (2010)","journal-title":"BuR - Business Research"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Self-interested Automated Mechanism Design and Implications for Optimal Combinatorial Auctions. In: Proceedings of the 5th ACM Conference on Electronic Commerce, EC 2004 (2004)","DOI":"10.1145\/988772.988793"},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/S0377-2217(03)00263-7","volume":"153","author":"X. Delorme","year":"2004","unstructured":"Delorme, X., Gandibleux, X., Rodriguez, J.: GRASP for Set Packing Problems. European Journal of Operational Research\u00a0153(3), 564\u2013580 (2004)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization\u00a06(2), 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"33_CR5","series-title":"SCI","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-33876-5_13","volume-title":"Multiagent based Supply Chain Management","author":"A. Fink","year":"2006","unstructured":"Fink, A.: Supply Chain Coordination by Means of Automated Negotiations Between Autonomous Agents. In: Chaib-draa, B., M\u00fcller, J. (eds.) Multiagent based Supply Chain Management. SCI, vol.\u00a028, pp. 351\u2013372. Springer, Heidelberg (2006)"},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1008746126376","volume":"10","author":"N.R. Jennings","year":"2001","unstructured":"Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Sierra, C., Wooldridge, M.: Automated Negotiation: Prospects, Methods and Challenges. Group Decision and Negotiation\u00a010(2), 199\u2013215 (2001)","journal-title":"Group Decision and Negotiation"},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1023068821218","volume":"12","author":"M. Klein","year":"2003","unstructured":"Klein, M., Faratin, P., Sayama, H., Bar-Yam, Y.: Negotiating Complex Contracts. Group Decision and Negotiation\u00a012(2), 111\u2013125 (2003)","journal-title":"Group Decision and Negotiation"},{"key":"33_CR8","unstructured":"Klein: M., Faratin, P., Sayama, H., Bar-Yam, Y.: Negotiating Complex Contracts, MIT Sloan Working Paper No. 4196-01 (2007), \n                      \n                        http:\/\/ssrn.com\/paper=290147"},{"issue":"5","key":"33_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Lehmann, D., Callaghan, L., Shoham, Y.: Truth Revelation in Approximately Efficient Combinatorial Auctions. Journal of the ACM\u00a049(5), 577\u2013602 (2002)","journal-title":"Journal of the ACM"},{"key":"33_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813825","volume-title":"Putting Auction Theory to Work","author":"P.R. Milgrom","year":"2004","unstructured":"Milgrom, P.R.: Putting Auction Theory to Work. Cambridge University Press, Cambridge (2004)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Ronen, A.: Computationally Feasible VCG Mechanisms. Journal of Artificial Intelligence Research\u00a029, 19\u201347 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"11","key":"33_CR13","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1287\/mnsc.49.11.1485.20585","volume":"49","author":"A. Pekec","year":"2003","unstructured":"Pekec, A., Rothkopf, M.H.: Combinatorial Auction Design. Management Science\u00a049(11), 1485\u20131503 (2003)","journal-title":"Management Science"},{"key":"33_CR14","first-page":"201","volume-title":"Multiagent Systems: A Modern Introduction to Distributed Artificial Intelligence","author":"T. Sandholm","year":"1999","unstructured":"Sandholm, T.: Distributed Rational Decision Making. In: Wei\u03b2, G. (ed.) Multiagent Systems: A Modern Introduction to Distributed Artificial Intelligence, pp. 201\u2013258. MIT Press, Cambridge (1999)"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Winner Determination in Combinatorial Auction Generalizations. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS (2002)","DOI":"10.1145\/544741.544760"},{"issue":"1","key":"33_CR16","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. The Journal of Finance\u00a016(1), 8\u201337 (1961)","journal-title":"The Journal of Finance"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Zurel, E., Nisan, N.: An Efficient Approximate Allocation Algorithm for Combinatorial Auctions. In: Proceedings of the 3rd ACM Conference on Electronic Commerce (EC 2001), pp. 125\u2013136 (2001)","DOI":"10.1145\/501158.501172"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23857-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T13:13:52Z","timestamp":1554642832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23857-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642238567","9783642238574"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23857-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}