60 search results - page 1 / 12 » Where's the Winner |
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
IANDC
2010
13 years 3 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
IJCAI
2007
13 years 6 months ago
2007
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
IJCAI
2007
13 years 6 months ago
2007
Voting rules map collections of preference orderings over a set of candidates (one for each voter) to candidates. Now, in many contexts, we have to consider the case where either t...
AAAI
2008
13 years 7 months ago
2008
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...