Article ID: | iaor20101521 |
Volume: | 175 |
Issue: | 1 |
Start Page Number: | 107 |
End Page Number: | 158 |
Publication Date: | Mar 2010 |
Journal: | Annals of Operations Research |
Authors: | Charon Irne, Hudry Olivier |
In this paper, we survey some results, conjectures and open problems dealing with the combinatorial and algorithmic aspects of the linear ordering problem. This problem consists in finding a linear order which is at minimum distance from a (weighted or not) tournament. We show how it can be used to model an aggregation problem consisting of going from individual preferences defined on a set of candidates to a collective ranking of these candidates.