Ranking chain sum orders

DOI10.1016/J.TCS.2016.05.026MaRDI QIDQ290525zbMATHOpenAlexFDO

Authors Andreas Gleißner, Franz J. Brandenburg

Publication date 1 June 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.05.026

zbMATH Keywords

rankingpartial ordersNP-hardnesstotal ordersdistance measuresfixed-parameter complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Ordered chaining for total orderings
• Chain dominated orders
• Rearrangements and sequential rank order dominance
• Nested chain order
• Ranking by weighted sum
• Rank aggregation in cyclic sequences

Cites work

• scientific article; zbMATH DE number 2084271 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A Computer Method for Calculating Kendall's Tau with Ungrouped Data
• A complete axiomatisation for the inclusion of series-parallel partial orders
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Comparing Partial Rankings
• Comparing Top k Lists
• Comparing and aggregating partial orders with Kendall tau distances
• Computing distances between partial rankings
• Determining possible and necessary winners given partial orders
• Fixed-parameter algorithms for Kemeny rankings
• Introduction to algorithms
• Metric methods for analyzing partially ranked data
• On the complexity of crossings in permutations
• On the hardness of maximum rank aggregation problems
• Partial orders of dimension 2
• Ranking Tournaments
• Simple and Efficient Bilayer Cross Counting
• The Complexity of the Partial Order Dimension Problem
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• Voting schemes for which it can be difficult to tell who won the election
• When are elections with few candidates hard to manipulate?
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders

Cited in

(4)

• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Comparing and aggregating partial orders with Kendall tau distances
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Comparing and aggregating partial orders with Kendall tau distances

This page was built for publication: Ranking chain sum orders

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