Sciweavers

4 search results - page 1 / 1
» Universal Voting Protocol Tweaks to Make Manipulation Hard
Sort
View
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
ATAL
2005
Springer
13 years 10 months ago
Decentralized voting with unconditional privacy
The aggregation of conflicting preferences is a key issue in multiagent systems. Due to its universality, voting has a central role among preference aggregation mechanisms. Votin...
Felix Brandt, Tuomas Sandholm