Experiments with Kemeny ranking: What works when?
From MaRDI portal
Publication:449040
DOI10.1016/J.MATHSOCSCI.2011.08.008zbMATH Open1247.91041OpenAlexW1971005895MaRDI QIDQ449040FDOQ449040
Authors: Alnur Ali, Marina Meilă 
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Decision theory (91B06) Abstract computational complexity for mathematical programming problems (90C60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- Social choice and individual values
- An exponential model for infinite rankings
- Non-parametric modeling of partially ranked data
- NON-NULL RANKING MODELS. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Voting schemes for which it can be difficult to tell who won the election
- Partial kernelization for rank aggregation: theory and experiments
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Consistent Extension of Condorcet’s Election Principle
- Title not available (Why is that?)
- Fixed-parameter algorithms for Kemeny rankings
- Aggregating inconsistent information
- Title not available (Why is that?)
- A new heuristic algorithm solving the linear ordering problem
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Ranking tournaments: local search and a new algorithm
- Rank aggregation: together we're strong
Cited In (35)
- A probabilistic evaluation framework for preference aggregation reflecting group homogeneity
- Space reduction constraints for the median of permutations problem
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- Generalized rank-breaking: computational and statistical tradeoffs
- Automedian sets of permutations: direct sum and shuffle
- Mallows and generalized Mallows model for matchings
- A new approach for identifying the Kemeny median ranking
- Ensemble learning for the partial label ranking problem
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
- Probabilistic preference learning with the Mallows rank model
- Rank aggregation in cyclic sequences
- Partial kernelization for rank aggregation: theory and experiments
- 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
- Recursive inversion models for permutations
- Using extension sets to aggregate partial rankings in a flexible setting
- Rank constrained distribution and moment computations
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Aggregation over metric spaces: proposing and voting in elections, budgeting, and legislation
- Comparison of rank aggregation methods based on inherent ability
- Efficient and accurate inference for mixtures of Mallows models with Spearman distance
- Rank aggregation: together we're strong
- Rank aggregation using latent-scale distance-based models
- Ranking median regression: learning to order through local consensus
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Approaching the rank aggregation problem by local search-based metaheuristics
- Fixed-Parameter Algorithms for Kemeny Scores
- Exploring the median of permutations problem
- Decomposition procedures in problems of construction of strict resulting ranking of objects in the form of the Kemeny-Snell median
- Robust Learning of Consumer Preferences
- A generalized Mallows model based on \(\phi\)-divergence measures
- Computing kemeny rankings from \(d\)-Euclidean preferences
Uses Software
This page was built for publication: Experiments with Kemeny ranking: What works when?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449040)
