Sciweavers

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...
TARK
2007
Springer
13 years 11 months ago
Vote manipulation in the presence of multiple sincere ballots
A classical result in voting theory, the Gibbard-Satterthwaite Theorem, states that for any non-dictatorial voting rule for choosing between three or more candidates, there will b...
Ulle Endriss