COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES
From MaRDI portal
Publication:2846476
DOI10.1142/S1793830913600033zbMath1294.06002OpenAlexW2038974412WikidataQ61687017 ScholiaQ61687017MaRDI QIDQ2846476
Andreas Hofmeier, Andreas Gleißner, Franz-Josef 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
Partial orders, general (06A06) Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Ranking chain sum orders ⋮ Discovering a taste for the unusual: exceptional models for preference mining ⋮ On a weighted generalization of Kendall's tau distance ⋮ One-sided weak dominance drawing ⋮ On the hardness of maximum rank aggregation problems
Cites Work
- Kernels for feedback arc set in tournaments
- The complexity of Kemeny elections
- On the complexity of crossings in permutations
- Fixed-parameter algorithms for Kemeny rankings
- Voting schemes for which it can be difficult to tell who won the election
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Fixed-parameter tractability results for feedback set problems in tournaments
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- Bounded Query Classes
- Comparing Partial Rankings
