Fixed-parameter algorithms for Kemeny rankings
From MaRDI portal
Recommendations
- Fixed-Parameter Algorithms for Kemeny Scores
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Strong and weak stability of k-partite ranking algorithms
- Parameterized top-\(K\) algorithms
- An algorithm for rank aggregation problem
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- The asymptotics of ranking algorithms
- Algorithms for generalized vertex-rankings of partial k-trees
- An almost optimal algorithm for computing nonnegative rank
Cites work
- A general method to speed up fixed-parameter-tractable algorithms
- Aggregating inconsistent information: ranking and clustering
- Deconstructing Intractability: A Case Study for Interval Constrained Coloring
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Fixed-Parameter Algorithms for Kemeny Scores
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- scientific article; zbMATH DE number 5485529 (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?)
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- On complexity of lobbying in multiple referenda
- Parameterized complexity of candidate control in elections and related digraph problems
- Parameterized Computational Complexity of Dodgson and Young Elections
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Parametrized complexity theory.
- Rank aggregation: together we're strong
- The complexity of Kemeny elections
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(32)- Parameterized top-\(K\) algorithms
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- On the hardness of maximum rank aggregation problems
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- Space reduction constraints for the median of permutations problem
- Parameterized computational complexity of Dodgson and Young elections
- A new approach for identifying the Kemeny median ranking
- Computing kemeny rankings from d-Euclidean preferences
- Parameterized enumeration of (locally-) optimal aggregations
- Comparing and aggregating partial orders with Kendall tau distances
- Ranking chain sum orders
- Studies in Computational Aspects of Voting
- Ranking and drawing in subexponential time
- Partial kernelization for rank aggregation: theory and experiments
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Fixed-Parameter Algorithms for Kemeny Scores
- Kernelization: new upper and lower bound techniques
- Improved parameterized algorithms for the Kemeny aggregation problem
- Experiments with Kemeny ranking: What works when?
- Weighted tournament solutions
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- Recognizing when a preference system is close to admitting a master list
- On weakly and strongly popular rankings
- Recognizing when a preference system is close to admitting a master list
- Parameterized aspects of distinct Kemeny rank aggregation
- Parameterized aspects of distinct Kemeny rank aggregation
- How similar are two elections?
- Average parameterization and partial kernelization for computing medians
- Width notions for ordering-related problems
- Kernelization complexity of possible winner and coalitional manipulation problems in voting
This page was built for publication: Fixed-parameter algorithms for Kemeny rankings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035688)
