The complexity of losing voters

Abstract

We consider the scenario of a parliament that is going to vote on a specific important issue. The voters are grouped in parties, and all voters of a party vote in the same way. The expected winner decision is known, because parties declare their intentions to vote, but before the actual vote takes place some voters may leave the leading party to join other parties. We investigate the computational complexity of the problem of determining how many voters need to leave the leading party before the winner changes. We consider both positional scoring rules (plurality, veto, k-approval, k-veto, Borda) and Condorcet-consistent methods (maximin, Copeland), and we study two versions of the problem: a pessimistic one, where we want to determine the maximal number of voters that can leave the leading party without changing the winner; and an optimistic one, where we want the minimal number of voters that must leave the leading party to be sure the winner will change. These two numbers provide a measure of the threat to the expected winner, and thus to the leading party, given by losing some voters. We show that for many positional scoring rules these problems are easy (except for the optimistic version with k-approval,for k at least 3, and Borda). Instead, for Condorcet-consistent rules, they are both computationally difficult, with both Maximin and Copeland.