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

DOI10.1016/J.MATHSOCSCI.2011.06.004MaRDI QIDQ449031zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• NP-hardness results for the aggregation of linear orders into median orders
• The complexity of computing medians of relations.
• Complexity results for extensions of median orders to different types of remoteness
• Median linear orders: Heuristics and a branch and bound algorithm
• A new approach for identifying the Kemeny median ranking

Cites work

• scientific article; zbMATH DE number 3650616 (Why is no real title available?)
• scientific article; zbMATH DE number 3148878 (Why is no real title available?)
• scientific article; zbMATH DE number 3980481 (Why is no real title available?)
• scientific article; zbMATH DE number 107798 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1082112 (Why is no real title available?)
• scientific article; zbMATH DE number 5586137 (Why is no real title available?)
• A survey on the complexity of tournament solutions
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
• Finite ordered sets. Concepts, results and applications
• NP-hardness results for the aggregation of linear orders into median orders
• On the complexity of Slater's problems
• On the complexity of crossings in permutations
• Ranking Tournaments
• Social choice and individual values
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• The complexity of Kemeny elections
• The complexity of computing medians of relations.
• The median procedure in cluster analysis and social choice theory
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(9)

• A note on clustering aggregation for binary clusterings
• Voting procedures, complexity of
• NP-hardness results for the aggregation of linear orders into median orders
• Primary facets of order polytopes
• The complexity of computing medians of relations.
• Complexity results for extensions of median orders to different types of remoteness
• New results on the computation of median orders
• A new consensus ranking approach for correlated ordinal information based on Mahalanobis distance
• Median linear orders: Heuristics and a branch and bound algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449031)