On the computation of median linear orders, of median complete preorders and of median weak orders

DOI10.1016/J.MATHSOCSCI.2011.06.004zbMath1247.91047OpenAlexW2041488837MaRDI QIDQ449031

Olivier Hudry

Publication date: 11 September 2012

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2011.06.004

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Individual preferences (91B08)

Related Items (4)

Voting Procedures, Complexity of ⋮ A new consensus ranking approach for correlated ordinal information based on Mahalanobis distance ⋮ Primary facets of order polytopes ⋮ Complexity results for extensions of median orders to different types of remoteness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of Kemeny elections
• Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• On the complexity of crossings in permutations
• A survey on the complexity of tournament solutions
• On the complexity of Slater's problems
• Voting schemes for which it can be difficult to tell who won the election
• The median procedure in cluster analysis and social choice theory
• NP-hardness results for the aggregation of linear orders into median orders
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Finite ordered sets. Concepts, results and applications
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Ranking Tournaments

This page was built for publication: On the computation of median linear orders, of median complete preorders and of median weak orders