116 search results - page 1 / 24 » Anonymity-Proof Voting Rules |
DAGSTUHL
2007
13 years 6 months ago
2007
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
TARK
2007
Springer
13 years 11 months ago
2007
Springer
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...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
WINE
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we characterize strategy-proof voting rules when the set of alternatives has a multi-issue structure, and the voters' preferences are represented by acyclic CP-...