Sciweavers

24 search results - page 3 / 5
» Small vote manipulations can swing elections
Sort
View
80
Voted
ACSAC
2009
IEEE
15 years 4 months ago
The Design of a Trustworthy Voting System
– After the voting debacle in the Florida Presidential election of 2000 with its now-fabled hanging chads and pregnant chads, many voting jurisdictions turned to electronic votin...
Nathanael Paul, Andrew S. Tanenbaum
88
Voted
AAAI
2010
14 years 7 months ago
Cloning in Elections
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
ACSAC
2006
IEEE
15 years 3 months ago
An Internet Voting System Supporting User Privacy
This work introduces the A system1 , an Internetbased, free and open source electronic voting system which employs strong cryptography. Our system is a fully functiona...
Aggelos Kiayias, Michael Korman, David Walluck
81
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 9 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
74
Voted
AAAI
2010
14 years 11 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...