160 search results - page 4 / 32 » Approximability of Manipulating Elections |
SIAMCOMP
2011
12 years 9 months ago
2011
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
JAIR
2008
13 years 6 months ago
2008
Although recent years have seen a surge of interest in the computational aspects of social choice, no specific attention has previously been devoted to elections with multiple win...
SAC
2009
ACM
13 years 11 months ago
2009
ACM
The firmware of an electronic voting machine is typically treated as a “trusted” component of the system. Consequently, it is misconstrued to be vulnerable only to an insider...
AAAI
2007
13 years 8 months ago
2007
Uncertainty arises in preference aggregation in several ways. There may, for example, be uncertainty in the votes or the voting rule. Such uncertainty can introduce computational ...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...