An updated survey on the linear ordering problem for weighted or unweighted tournaments

An updated survey on the linear ordering problem for weighted or unweighted tournaments

0.00 Avg rating0 Votes
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: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.