687 search results - page 4 / 138 » On The Complexity of Manipulating Elections |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
CORR
2010
Springer
13 years 7 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...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form o...
AAAI
2012
11 years 9 months ago
2012
In many mechanisms (especially online mechanisms), a strategic agent can influence the outcome by creating multiple false identities. We consider voting settings where the mechan...
AAAI
2008
13 years 9 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...