49 search results - page 2 / 10 » Metasearch via Voting |
AMAST
2004
Springer
13 years 10 months ago
2004
Springer
This abstract provides some background information about the electronic voting experiment that is planned in the Netherlands for the European Elections of 2004, and about our own i...
AAAI
2010
13 years 6 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...
SIGIR
2012
ACM
11 years 7 months ago
2012
ACM
In crowdsourced relevance judging, each crowd worker typically judges only a small number of examples, yielding a sparse and imbalanced set of judgments in which relatively few wo...
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...
AAAI
2012
11 years 7 months ago
2012
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a ration...