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.
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.