The complexity of Vote Control problem under simple rules
Qin Qin · Journal of Hunan University of Science & Technology · 2013
Given a set of candidatesC,a profile of partial votesV=(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 underk′-approval rule was also obtained.