Article ID Journal Published Year Pages File Type
6423699 Electronic Notes in Discrete Mathematics 2016 6 Pages PDF
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 influence 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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The Complexity of Measuring Power in Generalized Opinion Leader Decision Models
Authors
, ,