A multivariate complexity analysis of voting problems
Voting describes a joint decision making process where voters choose winners out of a set of candidates. Many voting systems entail difficult computational problems. This work investigates the winner and possible winner determination and the influence an external agent can exert by adding or deleting candidates. Taking into account the computational difficulty, that is, NP-hardness of the studied problems, the work applies a multivariate complexity analysis aiming at identifying tractable scenarios or showing intractability.