{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:59:12Z","timestamp":1770289152137,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,5,9]]},"DOI":"10.1145\/3587135.3592192","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T10:22:41Z","timestamp":1691144561000},"page":"197-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["QuACS"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9824-7399","authenticated-orcid":false,"given":"Supreeth Mysore","family":"Venkatesh","sequence":"first","affiliation":[{"name":"German Research Center for Artificial Intelligence (DFKI), Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1348-250X","authenticated-orcid":false,"given":"Antonio","family":"Macaluso","sequence":"additional","affiliation":[{"name":"German Research Center for Artificial Intelligence (DFKI), Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5431-8640","authenticated-orcid":false,"given":"Matthias","family":"Klusch","sequence":"additional","affiliation":[{"name":"German Research Center for Artificial Intelligence (DFKI), Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2891460.2891472"},{"key":"e_1_3_2_1_2_1","volume-title":"Efficient Coalition Structure Generation via Approximately Equivalent Induced Subgraph Games","author":"Bistaffa Filippo","year":"2021","unstructured":"Filippo Bistaffa, Georgios Chalkiadakis, and Alessandro Farinelli. 2021. Efficient Coalition Structure Generation via Approximately Equivalent Induced Subgraph Games. IEEE Transactions on Cybernetics (2021)."},{"key":"e_1_3_2_1_3_1","volume-title":"Juan Antonio Rodriguez-Aguilar, and Sarvapali D Ramchurn","author":"Bistaffa Filippo","year":"2014","unstructured":"Filippo Bistaffa, Alessandro Farinelli, Jes\u00fas Cerquides, Juan Antonio Rodriguez-Aguilar, and Sarvapali D Ramchurn. 2014. Anytime coalition structure generation on synergy graphs. (2014)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i18.17879"},{"key":"e_1_3_2_1_5_1","volume-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419","author":"Crooks Gavin E","year":"2018","unstructured":"Gavin E Crooks. 2018. Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419 (2018)."},{"key":"e_1_3_2_1_6_1","volume-title":"On the complexity of cooperative solution concepts. Mathematics of operations research 19, 2","author":"Deng Xiaotie","year":"1994","unstructured":"Xiaotie Deng and Christos H Papadimitriou. 1994. On the complexity of cooperative solution concepts. Mathematics of operations research 19, 2 (1994), 257--266."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-17-479"},{"key":"e_1_3_2_1_8_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)."},{"key":"e_1_3_2_1_9_1","volume-title":"C-link: A hierarchical clustering approach to large-scale near-optimal coalition formation.","author":"Farinelli Alessandro","year":"2013","unstructured":"Alessandro Farinelli, Manuele Bicego, Sarvapali Ramchurn, and Marco Zuchelli. 2013. C-link: A hierarchical clustering approach to large-scale near-optimal coalition formation. (2013)."},{"key":"e_1_3_2_1_10_1","volume-title":"Community detection in graphs. Physics reports 486, 3--5","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato. 2010. Community detection in graphs. Physics reports 486, 3--5 (2010), 75--174."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/578533"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67074-4_32"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/AGENTS.2017.8015295"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 3. 1417--1420","author":"Rahwan Talal","year":"2008","unstructured":"Talal Rahwan and Nicholas R Jennings. 2008. An improved dynamic programming algorithm for coalition structure generation. In Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 3. 1417--1420."},{"key":"e_1_3_2_1_15_1","volume-title":"Coalition structure generation with worst case guarantees. Artificial intelligence 111, 1--2","author":"Sandholm Tuomas","year":"1999","unstructured":"Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, and Fernando Tohm\u00e9. 1999. Coalition structure generation with worst case guarantees. Artificial intelligence 111, 1--2 (1999), 209--238."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3528416.3530235"},{"key":"e_1_3_2_1_17_1","volume-title":"GCS-Q: Quantum Graph Coalition Structure Generation. arXiv preprint arXiv:2212.11372","author":"Venkatesh Supreeth Mysore","year":"2022","unstructured":"Supreeth Mysore Venkatesh, Antonio Macaluso, and Matthias Klusch. 2022. GCS-Q: Quantum Graph Coalition Structure Generation. arXiv preprint arXiv:2212.11372 (2022)."},{"key":"e_1_3_2_1_18_1","unstructured":"Thomas Voice Sarvapali Ramchurn and Nick Jennings. 2012. On coalition formation with sparse synergies. (2012)."}],"event":{"name":"CF '23: 20th ACM International Conference on Computing Frontiers","location":"Bologna Italy","acronym":"CF '23","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 20th ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3587135.3592192","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3587135.3592192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:14Z","timestamp":1750178834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3587135.3592192"}},"subtitle":["Variational Quantum Algorithm for Coalition Structure Generation in Induced Subgraph Games"],"short-title":[],"issued":{"date-parts":[[2023,5,9]]},"references-count":18,"alternative-id":["10.1145\/3587135.3592192","10.1145\/3587135"],"URL":"https:\/\/doi.org\/10.1145\/3587135.3592192","relation":{},"subject":[],"published":{"date-parts":[[2023,5,9]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}