Sciweavers

67 search results - page 3 / 14
» A Computational Study of the Kemeny Rule for Preference Aggr...
Sort
View
AAAI
2007
13 years 9 months ago
Uncertainty in Preference Elicitation and Aggregation
Uncertainty arises in preference aggregation in several ways. There may, for example, be uncertainty in the votes or the voting rule. Such uncertainty can introduce computational ...
Toby Walsh
KDD
2009
ACM
184views Data Mining» more  KDD 2009»
14 years 2 months ago
Thumbs-Up: a game for playing to rank search results
Human computation is an effective way to channel human effort spent playing games to solving computational problems that are easy for humans but difficult for computers to autom...
Ali Dasdan, Chris Drome, Santanu Kolay, Micah Alpe...
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
AAMAS
2011
Springer
13 years 2 months ago
Aggregating value ranges: preference elicitation and truthfulness
We study the case where agents have preferences over ranges (intervals) of values, and we wish to elicit and aggregate these preferences. For example, consider a set of climatologi...
Joseph Farfel, Vincent Conitzer
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen