We consider decision models associated with cooperative influence games, the oblivious and the non-oblivious influence models. In those models the satisfaction and the power measures were introduced and studied. We analyze the computational complexity of those measures when the in
uence level is set to unanimity and the rule of decision is simple majority. We show that computing the satisfaction and the power measure in those systems are #P-hard.
Molinero, X., Riquelme, F., Serna, M. Satisfaction and power in unanimous majority influence decision models. "Electronic notes in discrete mathematics", Juliol 2018, vol. 68, p. 197-202.