Sciweavers

7 search results - page 1 / 2
» Hybrid Voting Protocols and Hardness of Manipulation
Sort
View
ISAAC
2005
Springer
112views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Hybrid Voting Protocols and Hardness of Manipulation
This paper addresses the problem of constructing voting protocols that are hard to manipulate. We describe a general technique for obtaining a new protocol by combining two or more...
Edith Elkind, Helger Lipmaa
FC
2005
Springer
88views Cryptology» more  FC 2005»
13 years 10 months ago
Small Coalitions Cannot Manipulate Voting
We demonstrate how to make voting protocols resistant against manipulation by computationally bounded malicious voters, by extending the previous results of Conitzer and Sandholm i...
Edith Elkind, Helger Lipmaa
CORR
2002
Springer
125views Education» more  CORR 2002»
13 years 4 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm
CATS
2007
13 years 6 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague