Preference aggregation in group recommender systems for committee decision-making

We present a preference aggregation algorithm designed for situations in which a limited number of users each review a small subset of a large (but finite) set of candidates. This algorithm aggregates scores by using users' relative preferences to search for a Kemeny-optimal ordering of items, and then uses this ordering to identify good and bad items, as well as those that are the subject of reviewer conflict. The algorithm uses variable-neighborhood local search, allowing the efficient discovery of high-quality consensus orderings while remaining computationally feasible. It provides a significant increase in solution quality over existing systems. We discuss potential applications of this algorithm in group recommender systems for a variety of scenarios, including program committees and faculty searches.

[1]  Anthony Jameson,et al.  More than the sum of its members: challenges for group recommender systems , 2004, AVI.

[2]  K. Arrow,et al.  Social Choice and Individual Values , 1951 .

[3]  Oscar Nierstrasz Identify the Champion , 1998 .

[4]  Irène Charon,et al.  A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments , 2006, Discret. Appl. Math..

[5]  Andrew Lim,et al.  Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem , 2003, GECCO.

[6]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

[7]  Donald G. Saari,et al.  GEOMETRY, VOTING, AND PARADOXES , 1998 .

[8]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[9]  Boaz Golany,et al.  Creating a consensus ranking of proposals from reviewers' partial ordinal rankings , 2007, Comput. Oper. Res..

[10]  M. Laguna,et al.  Scatter search for the linear ordering problem , 1999 .

[11]  S. Shapiro,et al.  Mathematics without Numbers , 1993 .

[12]  Jordi Petit,et al.  Experiments on the minimum linear arrangement problem , 2003, ACM J. Exp. Algorithmics.

[13]  Joseph F. McCarthy,et al.  MusicFX: an arbiter of group preferences for computer supported collaborative workouts , 1998, CSCW '98.

[14]  Ana L. C. Bazzan,et al.  Optimizing Preferences within Groups: A Case Study on Travel Recommendation , 2008, SBIA.

[15]  Rafael Martí,et al.  Variable neighborhood search for the linear ordering problem , 2006, Comput. Oper. Res..