{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T15:40:00Z","timestamp":1780155600481,"version":"3.54.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T00:00:00Z","timestamp":1266969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10458-010-9123-8","type":"journal-article","created":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T09:17:29Z","timestamp":1266916649000},"page":"225-248","source":"Crossref","is-referenced-by-count":80,"title":["Coalition formation for task allocation: theory and algorithms"],"prefix":"10.1007","volume":"22","author":[{"given":"Travis C.","family":"Service","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julie A.","family":"Adams","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,2,24]]},"reference":[{"key":"9123_CR1","doi-asserted-by":"crossref","unstructured":"Abdallah, S., & Lesser, V. (2004). Organization-based cooperative coalition formation. In Proceedings of the IEEE\/WIC\/ACM international conference on intelligent agent techonology (pp. 162\u2013168), IAT.","DOI":"10.1109\/IAT.2004.1342939"},{"key":"9123_CR2","unstructured":"Baliyarasimhuni, S. P., & Beard, R. W. (2008). Multiple UAV coalition formation. In American control conference (pp. 2010\u20132015)."},{"issue":"3","key":"9123_CR3","first-page":"178","volume":"7","author":"P. Berman","year":"2000","unstructured":"Berman P. (2000) A d\/2 approximation for maximum weight independent set in d-Claw free graphs. Nordic Journal of Computing 7(3): 178\u2013184","journal-title":"Nordic Journal of Computing"},{"key":"9123_CR4","unstructured":"Campbell, A., Wu, A. S., & Shumaker, R. (2002). Multi-agent task allocation: Learning when to say No. In GECCO \u201908: Proceedings of the 10th annual conference on genetic and evolutionary computation (pp. 201\u2013208), New York, NY, USA, ACM."},{"key":"9123_CR5","doi-asserted-by":"crossref","unstructured":"Fanelli, L., Farinelli, A., Iocchi, L., Nardi, D., & Settembre, G. P. (2006). Ontology-based coalition formation in heterogeneous MRS. In Proceedings of the 2006 international symposium on practical cognitive agents and robots (pp. 105\u2013116).","DOI":"10.1145\/1232425.1232441"},{"key":"9123_CR6","unstructured":"Halld\u00f3rsson, M. M. (1998). Approximations of independent sets in graphs. In APPROX \u201998: Proceedings of the international workshop on approximation algorithms for combinatorial optimization (pp. 1\u201313). London, UK: Springer."},{"issue":"2","key":"9123_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1006\/jagm.2000.1155","volume":"39","author":"M. M. Halld\u00f3rsson","year":"2001","unstructured":"Halld\u00f3rsson M. M., Chandra B. (2001) Greedy local improvement and weighted set packing approximation. Journal of Algorithms 39(2): 223\u2013240","journal-title":"Journal of Algorithms"},{"issue":"1","key":"9123_CR8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan E., Safra S., Schwartz O. (2006) On the complexity of approximating k-set packing. Computational Complexity 15(1): 20\u201339","journal-title":"Computational Complexity"},{"issue":"4","key":"9123_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft J. E., Karp R. M. (1973) An n 5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal of Computing 2(4): 225\u2013231","journal-title":"SIAM Journal of Computing"},{"key":"9123_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H. Kuhn","year":"1955","unstructured":"Kuhn H. (1955) The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2: 83\u201397","journal-title":"Naval Research Logistic Quarterly"},{"key":"9123_CR11","unstructured":"Lau, H. C., & Zhang, L. (2003). Task allocation via multi-agent coalition formation: Taxonomy, algorithms and complexity. In ICTAI \u201903: Proceedings of the 15th IEEE international conference on tools with artificial intelligence (p. 346). Washington, DC: IEEE Computer Society USA."},{"key":"9123_CR12","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1613\/jair.2695","volume":"34","author":"T. Rahwan","year":"2003","unstructured":"Rahwan T., Ramchurn S., Jennings N., Giovannucci A. (2003) An anytime algorithm for optimal coalition structure generation. Journal of Artificial Intelligence Research 34: 521\u2013567","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1\u20132","key":"9123_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Sandholm T. (2002) An algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1\u20132): 1\u201354","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"9123_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0004-3702(99)00036-3","volume":"111","author":"Y. Sandholm","year":"1999","unstructured":"Sandholm Y., Larson K., Anderson M., Shehory O., Tohm\u00e9 F. (1999) Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1\u20132): 209\u2013238","journal-title":"Artificial Intelligence"},{"key":"9123_CR15","unstructured":"Sariel, S. (2007). An integrated planning, scheduling and execution framework for multi-robot cooperation and coordination. PhD thesis, Istanbul Technical University."},{"issue":"1\u20132","key":"9123_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0004-3702(98)00045-9","volume":"101","author":"O. Shehory","year":"1998","unstructured":"Shehory O., Kraus S. (1998) Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1\u20132): 165\u2013200","journal-title":"Artificial Intelligence"},{"key":"9123_CR17","doi-asserted-by":"crossref","unstructured":"Tang, F., & Parker, L. E. (2005). ASyMTRe: Automated synthesis of multi-robot task solutions through software reconfiguration. In Proceedings of the IEEE international conference on robotics and automation (pp. 1770\u20131777).","DOI":"10.1109\/ROBOT.2005.1570327"},{"key":"9123_CR18","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/11512073_8","volume":"3446","author":"P. Tosi\u0107","year":"2005","unstructured":"Tosi\u0107 P., Agha G. (2005) Maximal clique based distributed coalition formation for task allocation in large-scale multi-agent systems. Massively Multi-Agent Systems I 3446: 104\u2013120","journal-title":"Massively Multi-Agent Systems I"},{"issue":"4","key":"9123_CR19","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TRO.2006.878948","volume":"22","author":"L. Vig","year":"2006","unstructured":"Vig L., Adams J. A. (2006) Multi-robot coalition formation. IEEE Transactions on Robotics 22(4): 637\u2013649","journal-title":"IEEE Transactions on Robotics"},{"issue":"1","key":"9123_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10846-007-9150-0","volume":"50","author":"L. Vig","year":"2007","unstructured":"Vig L., Adams J. A. (2007) Coalition formation: From software agents to robots. Journal of Intelligent Robotics Systems 50(1): 85\u2013118","journal-title":"Journal of Intelligent Robotics Systems"},{"key":"9123_CR21","unstructured":"Zuckerman, D. (2006). Linear degree extractors and the inapproximability of max clique and chromatic number. In STOC \u201906: Proceedings of the thirty-eighth annual ACM symposium on theory of computing (pp. 681\u2013690). New York, NY, USA."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-010-9123-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-010-9123-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-010-9123-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:28:26Z","timestamp":1559136506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-010-9123-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,24]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9123"],"URL":"https:\/\/doi.org\/10.1007\/s10458-010-9123-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,24]]}}}