{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:20Z","timestamp":1742914160658,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031212024"},{"type":"electronic","value":"9783031212031"}],"license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21203-1_24","type":"book-chapter","created":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:35:25Z","timestamp":1668152125000},"page":"399-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An MCTS-Based Algorithm to\u00a0Solve Sequential CFGs on\u00a0Valuation Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8252-4099","authenticated-orcid":false,"given":"Tabajara","family":"Krausburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-1440","authenticated-orcid":false,"given":"J\u00fcrgen","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8688-9901","authenticated-orcid":false,"given":"Rafael H.","family":"Bordini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,12]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47, 235\u2013256 (2002). https:\/\/doi.org\/10.1023\/A:1013689704352","journal-title":"Mach. Learn."},{"key":"24_CR2","unstructured":"Bistaffa, F., Farinelli, A., Cerquides, J., Rodr\u00edguez-Aguilar, J., Ramchurn, S.D.: Anytime coalition structure generation on synergy graphs. In: Proceedings of the 13th International Conference on Autonomous Agents and Multi-agent Systems, pp. 13\u201320. IFAAMS (2014)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4, 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"24_CR4","unstructured":"Dann, M., Thangarajah, J., Yao, Y., Logan, B.: Intention-aware multiagent scheduling. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 285\u2013293. IFAAMS (2020)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.engappai.2016.12.018","volume":"59","author":"A Farinelli","year":"2016","unstructured":"Farinelli, A., Bicego, M., Bistaffa, F., Ramchurn, S.D.: A hierarchical clustering approach to large-scale near-optimal coalition formation with quality guarantees. Eng. Appl. Artif. Intell. 59, 170\u2013185 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"24_CR6","unstructured":"FEMA: National Incident Management System. Independently Published (2017)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.artint.2017.04.005","volume":"249","author":"G Greco","year":"2017","unstructured":"Greco, G., Guzzo, A.: Constrained coalition formation on valuation structures. Artif. Intell. 249, 19\u201346 (2017)","journal-title":"Artif. Intell."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"24_CR9","unstructured":"Krausburg, T., Dix, J., Bordini, R.H.: Feasible coalition sequences. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pp. 719\u2013727. IFAAMAS (2021)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Krausburg, T., Dix, J., Bordini, R.H.: Computing sequences of coalition structures. In: Proceedings of the 2nd Symposium Series on Computational Intelligence, pp. 01\u201307. IEEE (2021)","DOI":"10.1109\/SSCI50451.2021.9660127"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Lee, J., Jeon, W., Kim, G., Kim, K.: Monte-Carlo tree search in continuous action spaces with value gradients. In: Proceedings of the 34th Conference on Artificial Intelligence, pp. 4561\u20134568. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i04.5885"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.artint.2015.09.006","volume":"230","author":"T Michalak","year":"2015","unstructured":"Michalak, T., Rahwan, T., Elkind, E., Wooldridge, M., Jennings, N.R.: A hybrid exact algorithm for complete set partitioning. Artif. Intell. 230, 14\u201350 (2015)","journal-title":"Artif. Intell."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Pr\u00e4ntare, F., Appelgren, H., Heintz, F.: Anytime heuristic and monte Carlo methods for large-scale simultaneous coalition structure generation and assignment. In: Proceedings of the 35th Conference on Artificial Intelligence, pp. 11317\u201311324. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i13.17349"},{"key":"24_CR14","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":"24_CR15","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."},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L.S.: Cores of convex games. Int. J. Game Theory 1(1), 11\u201326 (1971)","journal-title":"Int. J. Game Theory"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529, 484\u2013489 (2016)","journal-title":"Nature"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-019-09429-7","volume":"34","author":"O Skibski","year":"2020","unstructured":"Skibski, O., Michalak, T.P., Sakurai, Y., Wooldridge, M.J., Yokoo, M.: Partition decision trees: representation for efficient computation of the Shapley value extended to games with externalities. Auton. Agent. Multi-Agent Syst. 34, 1\u201339 (2020)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Wu, F., Ramchurn, S.D.: Monte-Carlo tree search for scalable coalition formation. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 407\u2013413. IJCAI Organization (2020)","DOI":"10.24963\/ijcai.2020\/57"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2022: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21203-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:39:44Z","timestamp":1668152384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21203-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"ISBN":["9783031212024","9783031212031"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21203-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"12 November 2022","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":"Valencia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prima2022.webs.upv.es\/","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":"100","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":"31","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":"15","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":"31% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 (demo paper)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}