Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CATS

2007

2007

We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manipulable. However, some, such as the Single Transferable Vote (STV) scheme used in Australian elections, are resistant to manipulation because it is NP-hard to compute the manipulating vote(s). We concentrate on STV and some natural generalisations of it called Scoring Elimination Protocols. We show that the hardness result for STV is true only if both the number of voters and the number of candidates are unbounded—we provide algorithms for a manipulation if either of these is ﬁxed. This means that manipulation would not be hard in practice when either number is small. Next we show that the weighted version of the manipulation problem is NP-hard for all Scoring Elimination Protocols except one, which we provide an algorithm for manipulating. Finally we experimentally test a heuristic for solving the manipul...

Related Content

Added |
29 Oct 2010 |

Updated |
29 Oct 2010 |

Type |
Conference |

Year |
2007 |

Where |
CATS |

Authors |
Tom Coleman, Vanessa Teague |

Comments (0)