{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:32:23Z","timestamp":1743111143895,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033377"},{"type":"electronic","value":"9783642033391"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03339-1_20","type":"book-chapter","created":{"date-parts":[[2009,7,13]],"date-time":"2009-07-13T09:00:33Z","timestamp":1247475633000},"page":"240-254","source":"Crossref","is-referenced-by-count":2,"title":["Multi-auction Approach for Solving Task Allocation Problem"],"prefix":"10.1007","author":[{"given":"Chi-Kong","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho-Fung","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)"},{"key":"20_CR2","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. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01726210","volume":"11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice\u00a011, 11\u201333 (1971)","journal-title":"Public Choice"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Ronen, A.: On The Expected Payment of Mechanisms for Task Allocation. In: Proceedings of The Twenty-third Annual ACM Symposium on Principles of Distributed Computing, pp. 252\u2013253 (2004)","DOI":"10.1145\/1011767.1011782"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Cherkassky, B.V., Goldberg, A.V., Martin, P., Setubal, J.C., Stolfi, J.: Augment or Push? A Computational Study of Bipartite Matching and Unit Capacity Maximum Flow Algorithms. ACM Journal of Experimental Algorithmics\u00a03(8) (1998)","DOI":"10.1145\/297096.297140"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Kraus, S., Shehory, O., Taase, G.: Coalition Formation with Uncertain Heterogeneous Information. In: Proceedings of 2nd International Conference on Autonomous Agents and Multi-Agent Systems, pp. 1\u20138 (2003)","DOI":"10.1145\/860575.860577"},{"key":"20_CR8","unstructured":"Kraus, S., Shehory, O., Taase, G.: The Advantages of Compromising in Coalition Formation with Incomplete Information. In: Proceedings of 3rd International Conference on Autonomous Agents and Multi-Agent Systems, pp. 588\u2013595 (2004)"},{"key":"20_CR9","unstructured":"FIPA Iterated Contract Net Interaction Protocol Specification, http:\/\/www.fipa.org\/specs\/fipa00030\/"},{"key":"20_CR10","unstructured":"Zhang, H.-J., Li, Q.-H., Ruan, Y.-L.: Resource Co-allocation Via Agent-based Coalition Formation in Computational Grids. In: 2003 International Conference on Machine Learning and Cybernetics, vol.\u00a03, pp. 1936\u20131940 (2003)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49116-3_1","volume-title":"STACS 99","author":"N. Nisan","year":"1999","unstructured":"Nisan, N.: Algorithms for Selfish Agents: Mechanism Design for Distributed Computation. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 1\u201317. Springer, Heidelberg (1999)"},{"key":"20_CR12","unstructured":"Issac, M., Salmon, T.C., Zillante, A.: A Theory of Jump Bidding in Ascending Auctions, Game Theory and Information 0404002, EconWPA (2004)"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems for Society"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03339-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:56:06Z","timestamp":1558425366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03339-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033377","9783642033391"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03339-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}