Efficient algorithms using subiterative convergence for Kemeny ranking problem

DOI10.1016/j.cor.2018.06.007zbMath1392.62061OpenAlexW2807007444MaRDI QIDQ107991

Prakash Singh Badal, Ashish Das, Y. Aharonov

Publication date: October 2018

Published in: Computers & Operations Research, Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.06.007

zbMATH Keywords

heuristicsKemeny distanceconsensus rankingmedian rankingrank aggregation problemKemeny-Snell distance

Mathematics Subject Classification ID

Decision theory (91B06) Individual preferences (91B08) Statistical ranking and selection procedures (62F07) Social choice (91B14) Applications of statistics to psychology (62P15)

Related Items

A data-driven matching algorithm for ride pooling problem, Median constrained bucket order rank aggregation, Approximate Condorcet partitioning: solving large-scale rank aggregation problems, Computing kemeny rankings from \(d\)-Euclidean preferences, Exploring the median of permutations problem, RankAggSIgFUR

Uses Software

• PrefLib
• AS 136

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
• Algorithm AS 136: A K-Means Clustering Algorithm
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
• Experiments with Kemeny ranking: What works when?
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
• Voting schemes for which it can be difficult to tell who won the election
• Generalized permutation polytopes and exploratory graphical methods for ranked data
• Geometric representation of association between categories
• Distance-based and ad hoc consensus models in ordinal preference ranking
• NON-NULL RANKING MODELS. I
• An axiomatic approach to distance on partial orderings
• A new rank correlation coefficient with application to the consensus ranking problem
• A NEW MEASURE OF RANK CORRELATION