Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/240167
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | A COP Model for Graph-Constrained Coalition Formation (Extended Abstract) |
Autor: | Bistaffa, Filippo CSIC ORCID ; Farinelli, Alessandro | Palabras clave: | Agent-based and Multiagent Systems Constraint optimisation Cooperation and coordination Constraints and SAT |
Fecha de publicación: | 13-jul-2018 | Resumen: | We focus on Graph-Constrained Coalition Formation (GCCF), a widely studied subproblem of coalition formation where the set of valid coalitions is constrained by a graph. We propose COP-GCCF, a novel approach that models GCCF as a COP. We then solve such COP with a highly-parallel GPU implementation of Bucket Elimination, which is able to exploit the high constraint tightness of COP-GCCF. Results on realistic graphs, i.e., a crawl of the Twitter social graph, show that our approach outperforms state of the art algorithms (i.e., DyCE and IDP G ) by at least one order of magnitude, both in terms of runtime and memory. | Versión del editor: | http://dx.doi.org/10.24963/ijcai.2018/783 | URI: | http://hdl.handle.net/10261/240167 | DOI: | 10.24963/ijcai.2018/783 | Identificadores: | doi: 10.24963/ijcai.2018/783 |
Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
A COP Model for Graph-Constrained Coalition Formation (Extended Abstract).pdf | 123,09 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
61
checked on 29-mar-2024
Download(s)
38
checked on 29-mar-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.