Home
Publications
Awards
Light
Dark
Automatic
Paper-Conference
Aggregating Incomplete and Noisy Rankings
We consider the problem of learning the true ordering of a set of alternatives from largely incomplete and noisy rankings. We introduce …
Dimitris Fotakis
,
Alkis Kalavasis
,
Konstantinos Stavropoulos
PDF
Cite
URL
«
Cite
×