| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142305 | Operations Research Letters | 2015 | 4 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger,