116 search results - page 3 / 24 » Anonymity-Proof Voting Rules |
TARK
2007
Springer
14 years 1 months ago
2007
Springer
Multiple election paradoxes arise when voting separately on each issue from a set of related issues results in an obviously undesirable outcome. Several authors have argued that a...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Credit assignment is a fundamental issue for the Learning Classifier Systems literature. We engage in a detailed investigation of credit assignment in one recent system called UC...
AAAI
2010
13 years 9 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
A voting system is a set of rules that a community adopts to take collective decisions. In this paper we study voting systems for a particular kind of community: electronically me...