Given a set of candidatesC, a profile of partial votesV=(v1,v2,…,vn), and a distinguished candidatec∈C,is there a subset V′,|V′|≤k such that c∈r(V＼V′). The complexity of this problem is different under different scoring rules. The vote control problem was proved under Reto rule can be solved in polynomial time based on plurality rule, the NP-Complete proof of vote control problem underk′-approval rule was also obtained.