Computer Science – Artificial Intelligence
Scientific paper
2010-05-28
Computer Science
Artificial Intelligence
To appear in Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010)
Scientific paper
Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences. One barrier that might exist to such manipulation is computational complexity. In particular, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. In this paper, we study empirically the manipulability of single transferable voting (STV) to determine if computational complexity is really a barrier to manipulation. STV was one of the first voting rules shown to be NP-hard. It also appears one of the harder voting rules to manipulate. We sample a number of distributions of votes including uniform and real world elections. In almost every election in our experiments, it was easy to compute how a single agent could manipulate the election or to prove that manipulation by a single agent was impossible.
No associations
LandOfFree
An Empirical Study of the Manipulability of Single Transferable Voting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Empirical Study of the Manipulability of Single Transferable Voting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Empirical Study of the Manipulability of Single Transferable Voting will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-15937