Efficient algorithms using subiterative convergence for Kemeny ranking problem
From MaRDI portal
Recommendations
- Experiments with Kemeny ranking: What works when?
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- An algorithm for rank aggregation problem
- Rank aggregation: together we're strong
- On maximum rank aggregation problems
Cites work
- scientific article; zbMATH DE number 3543793 (Why is no real title available?)
- scientific article; zbMATH DE number 3405712 (Why is no real title available?)
- A NEW MEASURE OF RANK CORRELATION
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- A new rank correlation coefficient with application to the consensus ranking problem
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Algorithm AS 136: A K-Means Clustering Algorithm
- An axiomatic approach to distance on partial orderings
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Experiments with Kemeny ranking: What works when?
- Generalized permutation polytopes and exploratory graphical methods for ranked data
- Geometric representation of association between categories
- NON-NULL RANKING MODELS. I
- Social choice and individual values
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(11)- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- Fixed-parameter algorithms for Kemeny rankings
- Median constrained bucket order rank aggregation
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Computing kemeny rankings from \(d\)-Euclidean preferences
- Experiments with Kemeny ranking: What works when?
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Exploring the median of permutations problem
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- RankAggSIgFUR
- A data-driven matching algorithm for ride pooling problem
This page was built for publication: Efficient algorithms using subiterative convergence for Kemeny ranking problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q107991)
