Weighted voting games are a well-known and useful class of succinctly representable simple games that have many real-world applications, e.g., to model collective decision-making in legislative bodies or shareholder voting. Among the structural control types being analyzing, one is control by adding players to weighted voting games, so as to either change or to maintain a player’s power in the sense of the (probabilistic) Penrose–Banzhaf power index or the Shapley–Shubik power index. For the problems related to this control, the best known lower bound is PP-hardness, where PP is “probabilistic polynomial time,” and the best known upper bound is the class NP, i.e., the class NP with a PP oracle. We optimally raise this lower bound by showing NP^PP-hardness of all these problems for the Penrose–Banzhaf and the Shapley–Shubik indices, thus establishing completeness for them in that class. Our proof technique may turn out to be useful for solving other open problems related to weighted voting games with such a complexity gap as well.