24 search results - page 3 / 5 » Small vote manipulations can swing elections |
ACSAC
2009
IEEE
14 years 24 days ago
2009
IEEE
– 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...
AAAI
2010
13 years 4 months ago
2010
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...
ACSAC
2006
IEEE
14 years 1 days ago
2006
IEEE
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...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
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...
AAAI
2010
13 years 7 months ago
2010
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....