Returning Top-K : Preference Aggregation or Sortition, or is there a Better Middle Ground?
Given a large number of users’ preferences (numerical or ordinal scores, ranked order) over a large number of objects, returning top-k results entails selecting a small list/set containing exactly k objects that are most “appropriate “. In this article, I will investigate two alternatives for…
Read more…