Control complexity in Bucklin and fallback voting: A theoretical analysis

•Electoral control models ways of changing the outcome of an election via adding, deleting, or partitioning candidates or voters.•A long-running project of research seeks to classify the major voting systems in terms of their computational resistance.•We show that fallback voting is resistant to each of the common types of control except two destructive control types.•We show that Bucklin voting performs almost as well as fallback voting in terms of control resistance.•We investigate the parameterized control complexity of Bucklin and fallback voting.