Vote trading and subset sums

S. Bervoets, V. Merlin, G. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
152 Downloads (Pure)


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: Vote swapping; Vote trading; Manipulation; Subset sum problem
Original languageEnglish
Pages (from-to)99-102
Number of pages4
JournalOperations Research Letters
Issue number1
Publication statusPublished - 2015


Dive into the research topics of 'Vote trading and subset sums'. Together they form a unique fingerprint.

Cite this