Sciweavers

3 search results - page 1 / 1
» Small Coalitions Cannot Manipulate Voting
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
AAAI
2010
13 years 6 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...