Parameterized aspects of distinct Kemeny rank aggregation

DOI10.1007/978-3-031-52213-0_2MaRDI QIDQ6547816zbMATH OpenFDO

Authors Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-52213-0_2

zbMATH Keywords

diversityKemenyKendall-Tauvoting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Aggregating inconsistent information: ranking and clustering
• Cycles and intractability in a large class of aggregation rules
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Deterministic pivoting algorithms for constrained ranking and clustering problems
• Fixed-parameter algorithms for Kemeny rankings
• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• On the complexity of crossings in permutations
• Parameterized algorithms
• Parameterized and Exact Computation
• Rank aggregation: together we're strong
• The complexity of Kemeny elections
• The Continuum-Armed Bandit Problem
• The Dodgson ranking and its relation to Kemeny's method and Slater's rule
• Voting schemes for which it can be difficult to tell who won the election

This page was built for publication: Parameterized aspects of distinct Kemeny rank aggregation

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