Loading...
Loading...

Go to the content (press return)

The complexity of measuring power in generalized opinion leader decision models

Author
Molinero, X.; Serna, M.
Type of activity
Journal article
Journal
Electronic notes in discrete mathematics
Date of publication
2016-10
Volume
54
First page
205
Last page
210
DOI
https://doi.org/10.1016/j.endm.2016.09.036 Open in new window
Project funding
Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals ALBCOM
Computational Models and Methods for Massive Structured Data
Mathematical, computational and social aspects in voting and cooperation contexts
Repository
http://hdl.handle.net/2117/91242 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S1571065316301305 Open in new window
Abstract
We analyze the computational complexity of the power measure in models of collective decision: the generalized opinion leader-follower model and the oblivious and non-oblivious infuence models. We show that computing the power measure is #P-hard in all these models, and provide two subfamilies in which the power measure can be computed in polynomial time.
Citation
Molinero, X., Serna, M. The complexity of measuring power in generalized opinion leader decision models. "Electronic notes in discrete mathematics", Octubre 2016, vol. 54, p. 205-210.
Keywords
Computational complexity, Decision-making models, Power measure
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods
GRTJ - Game Theory Research Group

Participants