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

Irène Charon () and Olivier Hudry ()

Annals of Operations Research, 2010, vol. 175, issue 1, 107-158

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. Copyright Springer Science+Business Media, LLC 2010

Keywords: Aggregation of preferences; Voting theory; Social choice; Linear ordering problem; Kemeny’s problem; Slater’s problem; Median order; Reversing set; Feedback arc set; Acyclic subgraph; Optimal triangulation; Graph theory; Tournament solutions; Complexity; Combinatorial optimization; Combinatorics (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-009-0648-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:175:y:2010:i:1:p:107-158:10.1007/s10479-009-0648-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-009-0648-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().