Extremal Coalitions for Influence Games Through Swarm Intelligence-Based Methods

Vista sencilla de ítem
dc.contributor.authorRiquelme, Fabián
dc.contributor.authorOlivares, Rodrigo
dc.contributor.authorMuñoz, Francisco
dc.contributor.authorMolinero, Xavier
dc.contributor.authorSerna, Maria
dc.date.accessioned2022-11-30T02:46:51Z
dc.date.available2022-11-30T02:46:51Z
dc.date.issued2022
dc.description.abstractAn influence game is a simple game represented over an influence graph (i.e., a labeled, weighted graph) on which the influence spread phenomenon is exerted. Influence games allow applying different properties and parameters coming from cooperative game theory to the contexts of social network analysis, decision-systems, voting systems, and collective behavior. The exact calculation of several of these properties and parameters is computationally hard, even for a small number of players. Two examples of these parameters are the length and the width of a game. The length of a game is the size of its smaller winning coalition, while the width of a game is the size of its larger losing coalition. Both parameters are relevant to know the levels of difficulty in reaching agreements in collective decision-making systems. Despite the above, new bio-inspired metaheuristic algorithms have recently been developed to solve the NP-hard influence maximization problem in an efficient and approximate way, being able to find small winning coalitions that maximize the influence spread within an influence graph. In this article, we apply some variations of this solution to find extreme winning and losing coalitions, and thus efficient approximate solutions for the length and the width of influence games. As a case study, we consider two real social networks, one formed by the 58 members of the European Union Council under nice voting rules, and the other formed by the 705 members of the European Parliament, connected by political affinity. Results are promising and show that it is feasible to generate approximate solutions for the length and width parameters of influence games, in reduced solving time.en_ES
dc.facultadFacultad de Ingenieríaen_ES
dc.file.nameRiquelme_Ext2022.pdf
dc.identifier.citationF. Riquelme, R. Olivares, F. Muñoz, X. Molinero and M. Serna, "Extremal coalitions for influence games through swarm intelligence-based methods," Computers, Materials & Continua, vol. 70, no.3, pp. 6305–6321, 2022.en_ES
dc.identifier.doihttps://doi.org/10.32604/cmc.2022.021804
dc.identifier.urihttp://repositoriobibliotecas.uv.cl/handle/uvscl/7513
dc.languageen
dc.publisherTech Science Press
dc.sourceComputers, Materials & Continua
dc.subjectINFLUENCE GAMEen_ES
dc.subjectINFLUENCE SPREADen_ES
dc.subjectCOLLECTIVE BEHAVIORen_ES
dc.subjectSWARM INTELLIGENCEen_ES
dc.subjectBIO-INSPIRED COMPUTINGen_ES
dc.titleExtremal Coalitions for Influence Games Through Swarm Intelligence-Based Methods
dc.typeArticulo
uv.departamentoEscuela de Ingenieria Informatica

Archivos

Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
Riquelme_Ext2022.pdf
Tamaño:
3.34 MB
Formato:
Adobe Portable Document Format
Descargar

Colecciones

Artículos investigadores UV