Vote trading and subset sums
Résumé
We analyze the complexity of vote trading problems with equal-sized voting districts.For two allied vote-swapping parties, the problem is polynomially solvable.For three parties, the problem is NP-complete.