205 search results - page 1 / 41 » Elections Can be Manipulated Often |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
CACM
2004
13 years 4 months ago
2004
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
CORR
2012
Springer
12 years 19 days ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
CORR
2010
Springer
13 years 5 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...