DMCA
Single transferable vote resists strategic voting (2003)
Cached
Download Links
| Citations: | 165 - 0 self |
BibTeX
@MISC{Bartholdi03singletransferable,
author = {John J. Bartholdi and III and James B. Orlin},
title = {Single transferable vote resists strategic voting},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We give evidence that Single Tranferable Vote (STV) is computation-ally resistant to manipulation: It is NP-complete to determine whether there exists a (possibly insincere) preference that will elect a favored candidate, even in an election for a single seat. Thus strategic voting under STV is qualitatively more difficult than under other commonly-used voting schemes. Furthermore, this resistance to manipulation is inherent to STV and does not depend on hopeful extraneous assumptions like the presumed difficulty of learning the preferences of the other voters. We also prove that it is NP-complete to recognize when an STV election violates monotonicity. This suggests that non-monotonicity in STV elections might be perceived as less threatening since it is in effect “hidden” and hard to exploit for strategic advantage.
