Experiments with Kemeny ranking: What works when?
From MaRDI portal
Publication:449040
DOI10.1016/j.mathsocsci.2011.08.008zbMath1247.91041OpenAlexW1971005895MaRDI QIDQ449040
Publication date: 11 September 2012
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2011.08.008
Decision theory (91B06) Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (27)
A generalized Mallows model based on \(\phi\)-divergence measures ⋮ Recursive inversion models for permutations ⋮ Partial evaluation in rank aggregation problems ⋮ A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion ⋮ Rank constrained distribution and moment computations ⋮ Robust Learning of Consumer Preferences ⋮ Space reduction constraints for the median of permutations problem ⋮ A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings ⋮ Approaching the rank aggregation problem by local search-based metaheuristics ⋮ Efficient and accurate inference for mixtures of Mallows models with Spearman distance ⋮ Ensemble learning for the partial label ranking problem ⋮ Computing kemeny rankings from \(d\)-Euclidean preferences ⋮ Exploring the median of permutations problem ⋮ Automedian sets of permutations: direct sum and shuffle ⋮ Using extension sets to aggregate partial rankings in a flexible setting ⋮ Mallows and generalized Mallows model for matchings ⋮ Rank aggregation in cyclic sequences ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient algorithms using subiterative convergence for Kemeny ranking problem ⋮ Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem ⋮ A probabilistic evaluation framework for preference aggregation reflecting group homogeneity ⋮ Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation ⋮ Rank aggregation using latent-scale distance-based models ⋮ A new approach for identifying the Kemeny median ranking ⋮ Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
Uses Software
Cites Work
- Fixed-parameter algorithms for Kemeny rankings
- Voting schemes for which it can be difficult to tell who won the election
- A new heuristic algorithm solving the linear ordering problem
- Partial Kernelization for Rank Aggregation: Theory and Experiments
- NON-NULL RANKING MODELS. I
- A Consistent Extension of Condorcet’s Election Principle
- Ranking Tournaments: Local Search and a New Algorithm
- Rank Aggregation: Together We're Strong
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Aggregating inconsistent information
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Experiments with Kemeny ranking: What works when?
