Comparing and aggregating partial orders with Kendall tau distances
DOI10.1142/S1793830913600033zbMATH Open1294.06002OpenAlexW2038974412WikidataQ61687017 ScholiaQ61687017MaRDI QIDQ2846476FDOQ2846476
Authors: Andreas Gleißner, Andreas Hofmeier, Franz J. Brandenburg 
Publication date: 5 September 2013
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830913600033
Recommendations
- Comparing and aggregating partial orders with Kendall tau distances
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Ranking chain sum orders
- On maximum rank aggregation problems
Partial orders, general (06A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Voting theory (91B12)
Cites Work
- Voting schemes for which it can be difficult to tell who won the election
- Comparing Partial Rankings
- The complexity of Kemeny elections
- On the complexity of crossings in permutations
- Fixed-parameter algorithms for Kemeny rankings
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Bounded Query Classes
- Fixed-parameter tractability results for feedback set problems in tournaments
- Kernels for feedback arc set in tournaments
- Deterministic pivoting algorithms for constrained ranking and clustering problems
Cited In (13)
- Comparing Partial Rankings
- Discovering a taste for the unusual: exceptional models for preference mining
- Comparing and aggregating partial orders with Kendall tau distances
- Ranking chain sum orders
- A linear ordering problem of sets
- On maximum rank aggregation problems
- Computing distances between partial rankings
- On a weighted generalization of Kendall's tau distance
- On the comparison of the Spearman and Kendall metrics between linear orders.
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- On the hardness of maximum rank aggregation problems
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- One-sided weak dominance drawing
This page was built for publication: Comparing and aggregating partial orders with Kendall tau distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846476)
