{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:35:44Z","timestamp":1775255744374,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030030971","type":"print"},{"value":"9783030030988","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03098-8_10","type":"book-chapter","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T08:27:33Z","timestamp":1540283253000},"page":"158-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Anytime Algorithm for Simultaneous Coalition Structure Generation and Assignment"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Pr\u00e4ntare","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Heintz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139167239","volume-title":"Integer Partitions","author":"G Andrews","year":"2004","unstructured":"Andrews, G., Eriksson, K.: Integer Partitions. Cambridge University Press, Cambridge (2004)"},{"key":"10_CR2","unstructured":"Buro, M.: Real-time strategy games: a new AI research challenge. In: International Joint Conference on Artificial Intelligence, pp. 1534\u20131535 (2003)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1613\/jair.3075","volume":"39","author":"G Chalkiadakis","year":"2010","unstructured":"Chalkiadakis, G., Elkind, E., Markakis, E., Polukarov, M., Jennings, N.R.: Cooperative games with overlapping coalitions. J. Artif. Intell. Res. 39, 179\u2013216 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"PC Chu","year":"1997","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalised assignment problem. Comput. Oper. Res. 24(1), 17\u201323 (1997)","journal-title":"Comput. Oper. Res."},{"key":"10_CR5","unstructured":"Dang, V.D., Dash, R.K., Rogers, A., Jennings, N.R.: Overlapping coalition formation for efficient data fusion in multi-sensor networks. In: AAAI, vol. 6, pp. 635\u2013640 (2006)"},{"issue":"6","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1007\/s10458-017-9367-7","volume":"31","author":"A Dukeman","year":"2017","unstructured":"Dukeman, A., Adams, J.A.: Hybrid mission planning with coalition formation. Auton. Agents Multi-Agent Syst. 31(6), 1424\u20131466 (2017)","journal-title":"Auton. Agents Multi-Agent Syst."},{"issue":"9","key":"10_CR7","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey, B.P., Matari\u0107, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23(9), 939\u2013954 (2004)","journal-title":"Int. J. Robot. Res."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-69131-2_7","volume-title":"PRIMA 2017: Principles and Practice of Multi-Agent Systems","author":"FR Habib","year":"2017","unstructured":"Habib, F.R., Polukarov, M., Gerding, E.H.: Optimising social welfare in multi-resource threshold task games. In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds.) PRIMA 2017. LNCS (LNAI), vol. 10621, pp. 110\u2013126. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69131-2_7"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TCOMM.2009.0901.060661","volume":"57","author":"Z Han","year":"2009","unstructured":"Han, Z., Poor, H.V.: Coalition games with cooperative transmission: a cure for the curse of boundary nodes in selfish packet-forwarding wireless networks. IEEE Trans. Commun. 57(1), 203\u2013213 (2009)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1017\/S0269888905000317","volume":"19","author":"B Horling","year":"2004","unstructured":"Horling, B., Lesser, V.: A survey of multi-agent organizational paradigms. Knowl. Eng. Rev. 19(4), 281\u2013316 (2004)","journal-title":"Knowl. Eng. Rev."},{"issue":"6","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.2307\/1913392","volume":"50","author":"Alexander S. Kelso","year":"1982","unstructured":"Kelso, A.S., Crawford, V.P.: Job matching, coalition formation, and gross substitutes. Econometrica: J. Econ. Soc. 1483\u20131504 (1982)","journal-title":"Econometrica"},{"issue":"1\u20132","key":"10_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Nav. Res. Logist. (NRL) 2(1\u20132), 83\u201397 (1955)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/095281300146290","volume":"12","author":"KS Larson","year":"2000","unstructured":"Larson, K.S., Sandholm, T.W.: Anytime coalition structure generation: an average case study. J. Exp. Theor. Artif. Intell. 12(1), 23\u201342 (2000)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Leibo, J.Z., Zambaldi, V., Lanctot, M., Marecki, J., Graepel, T.: Multi-agent reinforcement learning in sequential social dilemmas. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 464\u2013473. International Foundation for Autonomous Agents and Multiagent Systems (2017)","DOI":"10.65109\/QMSU8421"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico, D.W.: Assignment problems: a golden anniversary survey. Eur. J. Oper. Res. 176(2), 774\u2013793 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-319-69131-2_34","volume-title":"PRIMA 2017: Principles and Practice of Multi-Agent Systems","author":"F Pr\u00e4ntare","year":"2017","unstructured":"Pr\u00e4ntare, F., Ragnemalm, I., Heintz, F.: An algorithm for simultaneous coalition structure generation and task assignment. In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds.) PRIMA 2017. LNCS (LNAI), vol. 10621, pp. 514\u2013522. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69131-2_34"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Rahwan, T., Jennings, N.R.: An improved dynamic programming algorithm for coalition structure generation. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3, pp. 1417\u20131420. International Foundation for Autonomous Agents and Multiagent Systems (2008)","DOI":"10.65109\/XSMA8286"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Rahwan, T., Michalak, T.P., Jennings, N.R.: A hybrid algorithm for coalition structure generation. In: AAAI, pp. 1443\u20131449 (2012)","DOI":"10.1609\/aaai.v26i1.8265"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2015.08.004","volume":"229","author":"T Rahwan","year":"2015","unstructured":"Rahwan, T., Michalak, T.P., Wooldridge, M., Jennings, N.R.: Coalition structure generation: a survey. Artif. Intell. 229, 139\u2013174 (2015)","journal-title":"Artif. Intell."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1613\/jair.2695","volume":"34","author":"T Rahwan","year":"2009","unstructured":"Rahwan, T., Ramchurn, S.D., Jennings, N.R., Giovannucci, A.: An anytime algorithm for optimal coalition structure generation. J. Artif. Intell. Res. 34, 521\u2013567 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Ray, D., Vohra, R.: Coalition formation. In: Handbook of Game Theory with Economic Applications, vol. 4, pp. 239\u2013326. Elsevier (2015)","DOI":"10.1016\/B978-0-444-53766-9.00005-7"},{"issue":"1\u20132","key":"10_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0004-3702(99)00036-3","volume":"111","author":"T Sandholm","year":"1999","unstructured":"Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohm\u00e9, F.: Coalition structure generation with worst case guarantees. Artif. Intell. 111(1\u20132), 209\u2013238 (1999)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"10_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0004-3702(98)00045-9","volume":"101","author":"O Shehory","year":"1998","unstructured":"Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artif. Intell. 101(1\u20132), 165\u2013200 (1998)","journal-title":"Artif. Intell."},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/00207169808804755","volume":"70","author":"I Stojmenovi\u0107","year":"1998","unstructured":"Stojmenovi\u0107, I., Zoghbi, A.: Fast algorithms for genegrating integer partitions. Int. J. Comput. Math. 70(2), 319\u2013332 (1998)","journal-title":"Int. J. Comput. Math."},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-46632-0_25","volume-title":"Algorithms and Computation","author":"T Takaoka","year":"1999","unstructured":"Takaoka, T.: An O(1) time algorithm for generating multiset permutations. ISAAC 1999. LNCS, vol. 1741, pp. 237\u2013246. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46632-0_25"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Ueda, S., Iwasaki, A., Yokoo, M., Silaghi, M.C., Hirayama, K., Matsui, T.: Coalition structure generation based on distributed constraint optimization. In: AAAI, vol. 10, pp. 197\u2013203 (2010)","DOI":"10.1609\/aaai.v24i1.7552"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 987\u2013996. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611973068.107"},{"issue":"3","key":"10_CR29","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/S0377-2217(99)00100-9","volume":"123","author":"T Yamada","year":"2000","unstructured":"Yamada, T., Nasu, Y.: Heuristic and exact algorithms for the simultaneous assignment problem. Eur. J. Oper. Res. 123(3), 531\u2013542 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Yamamoto, J., Sycara, K.: A stable and efficient buyer coalition formation scheme for e-marketplaces. In: Proceedings of the Fifth International Conference on Autonomous Agents, pp. 576\u2013583. ACM (2001)","DOI":"10.1145\/375735.376452"},{"issue":"4","key":"10_CR31","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF01935053","volume":"26","author":"DY Yeh","year":"1986","unstructured":"Yeh, D.Y.: A dynamic programming approach to the complete set partitioning problem. BIT Numer. Math. 26(4), 467\u2013474 (1986)","journal-title":"BIT Numer. Math."},{"issue":"5","key":"10_CR32","doi-asserted-by":"publisher","first-page":"2659","DOI":"10.1109\/TWC.2014.032514.130942","volume":"13","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z., Song, L., Han, Z., Saad, W.: Coalitional games with overlapping coalitions for interference management in small cell networks. IEEE Trans. Wireless Commun. 13(5), 2659\u20132669 (2014)","journal-title":"IEEE Trans. Wireless Commun."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2018: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03098-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:15:23Z","timestamp":1775250923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03098-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030030971","9783030030988"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03098-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.prima-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}