Complexity of Additive Committee Selection with Outliers

We study the φ f-Outliers problem, where we are given an election and are asked whether there are at most n votes whose removal leads to the existence of a k-committee of a desired quality under the voting rule φ f. We investigate the (parameterized) complexity of φ f-Outliers for additive k-committee selection rules, in both the general case and several special cases with respect to the incidence graphs of the given elections.