NP-completeness of some problems concerning voting games
Coalition voting games with different weights of players are considered. A player is pivoting for a coalition if his participation in the coalition decides about its being winning. The paper concerns the computational NP-completeness of the problem of confirming lower bounds on the number of coalitions for which a given player is pivoting. A positive answer is proved for a few variants of the lower estimates.
scientific article; zbMATH DE number 4158422