{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:12:41Z","timestamp":1750911161947,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319691305"},{"type":"electronic","value":"9783319691312"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69131-2_9","type":"book-chapter","created":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T09:32:49Z","timestamp":1507109569000},"page":"143-159","source":"Crossref","is-referenced-by-count":2,"title":["Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation"],"prefix":"10.1007","author":[{"given":"Aolong","family":"Zha","sequence":"first","affiliation":[]},{"given":"Kazuki","family":"Nomoto","sequence":"additional","affiliation":[]},{"given":"Suguru","family":"Ueda","sequence":"additional","affiliation":[]},{"given":"Miyuki","family":"Koshimura","sequence":"additional","affiliation":[]},{"given":"Yuko","family":"Sakurai","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,5]]},"reference":[{"key":"9_CR1","volume-title":"Computational Aspects of Cooperative Game Theory","author":"G Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Morgan and Claypool Publishers, San Rafael (2011)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The Complexity of theorem-proving procedures. In: Harrison, M.A., Banerji, R.B., Ullman, J.D. (eds.) Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 3\u20135 May 1971, Shaker Heights, Ohio, USA, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"9_CR3","unstructured":"Dang, V.D., Dash, R.K., Rogers, A., Jennings, N.R.: Overlapping coalition formation for efficient data fusion in multi-sensor networks. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), pp. 635\u2013640 (2006)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: Proceedings of the 6th ACM Conference on Electronic Commerce (ACM EC), pp. 193\u2013202 (2005)","DOI":"10.1145\/1064009.1064030"},{"issue":"1\/2","key":"9_CR5","first-page":"95","volume":"8","author":"M Koshimura","year":"2012","unstructured":"Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: A Partial Max-SAT Solver. JSAT 8(1\/2), 95\u2013100 (2012)","journal-title":"JSAT"},{"key":"9_CR6","first-page":"613","volume-title":"Handbook of Satisfiability: Frontiers in Artificial Intelligence and Applications","author":"CM Li","year":"2009","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, hard and soft constraints. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability: Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 613\u2013631. IOS Press, Amsterdam (2009)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Liao, X., Koshimura, M., Fujita, H., Hasegawa, R.: Solving the coalition structure generation problem with MaxSAT. In: IEEE 24th International Conference on Tools with Artificial Intelligence, ICTAI 2012, Athens, Greece, 7\u20139 November 2012, pp. 910\u2013915. IEEE Computer Society (2012)","DOI":"10.1109\/ICTAI.2012.127"},{"issue":"7","key":"9_CR8","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1587\/transinf.E97.D.1812","volume":"97\u2013D","author":"X Liao","year":"2014","unstructured":"Liao, X., Koshimura, M., Fujita, H., Hasegawa, R.: Extending MaxSAT to solve the coalition structure generation problem with externalities based on agent relations. IEICE Trans. 97\u2013D(7), 1812\u20131821 (2014)","journal-title":"IEICE Trans."},{"issue":"7","key":"9_CR9","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1587\/transinf.E97.D.1781","volume":"97\u2013D","author":"X Liao","year":"2014","unstructured":"Liao, X., Koshimura, M., Fujita, H., Hasegawa, R.: MaxSAT encoding for MC-net-based coalition structure generation problem with externalities. IEICE Trans. 97\u2013D(7), 1781\u20131789 (2014)","journal-title":"IEICE Trans."},{"key":"9_CR10","unstructured":"Michalak, T., Rahwan, T., Marciniak, D., Szamotulski, M., Jennings, N.: Computational aspects of extending the shapley value to coalitional games with externalities. In: ECAI, pp. 197\u2013202 (2010)"},{"key":"9_CR11","unstructured":"Michalak, T.P., Marciniak, D., Szamotulski, M., Rahwan, T., Wooldridge, M., McBurney, P., Jennings, N.R.: A logic-based representation for coalitional games with externalities. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 125\u2013132 (2010)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-642-04244-7_49","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"N Ohta","year":"2009","unstructured":"Ohta, N., Conitzer, V., Ichimura, R., Sakurai, Y., Iwasaki, A., Yokoo, M.: Coalition structure generation utilizing compact characteristic function representations. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 623\u2013638. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04244-7_49"},{"key":"9_CR13","unstructured":"Rahwan, T., Michalak, T.P., Jennings, N.R., Wooldridge, M., McBurney, P.: Coalition structure generation in multi-agent systems with positive and negative externalities. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 257\u2013263 (2009)"},{"issue":"1\u20132","key":"9_CR14","doi-asserted-by":"crossref","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":"9_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(97)00030-1","volume":"94","author":"T Sandholm","year":"1997","unstructured":"Sandholm, T., Lesser, V.R.: Coalitions among computationally bounded agents. Artif. Intell. 94(1\u20132), 99\u2013137 (1997)","journal-title":"Artif. Intell."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Skibski, O., Michalak, T., Sakurai, Y., Wooldridge, M., Yokoo, M.: A Graphical Representation for Games in Partition Function Form. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1036\u20131042 (2015)","DOI":"10.1609\/aaai.v29i1.9306"},{"issue":"1","key":"9_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/nav.3800100126","volume":"10","author":"RM Thrall","year":"1963","unstructured":"Thrall, R.M., Lucas, W.F.: N-Person games in partition function form. Naval Res. Logistics Q. 10(1), 281\u2013298 (1963)","journal-title":"Naval Res. Logistics Q."},{"key":"9_CR18","unstructured":"Ueda, S., Hasegawa, T., Hashimoto, N., Ohta, N., Iwasaki, A., Yokoo, M.: Handling negative value rules in mc-net-based coalition structure generation. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 795\u2013804 (2012)"},{"issue":"4","key":"9_CR19","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2017: Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69131-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T00:18:16Z","timestamp":1750897096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69131-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319691305","9783319691312"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69131-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}