Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
From MaRDI portal
(Redirected from Publication:62323)
Abstract: Preference rankings virtually appear in all field of science (political sciences, behavioral sciences, machine learning, decision making and so on). The well-know social choice problem consists in trying to find a reasonable procedure to use the aggregate preferences expressed by subjects (usually called judges) to reach a collective decision. This problem turns out to be equivalent to the problem of estimating the consensus (central) ranking from data that is known to be a NP-hard Problem. Emond and Mason in 2002 proposed a branch and bound algorithm to calculate the consensus ranking given rankings expressed on objects. Depending on the complexity of the problem, there can be multiple solutions and then the consensus ranking may be not unique. We propose a new algorithm to find the consensus ranking that is equivalent to Emond and Mason's algorithm in terms of at least one of the solutions reached, but permits a really remarkable saving in computational time.
Recommendations
- A new approach for identifying the Kemeny median ranking
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- Experiments with Kemeny ranking: What works when?
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Distance and consensus for preference relations corresponding to ordered partitions
Cites work
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 4076317 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3543793 (Why is no real title available?)
- scientific article; zbMATH DE number 3607355 (Why is no real title available?)
- scientific article; zbMATH DE number 3345350 (Why is no real title available?)
- scientific article; zbMATH DE number 3405712 (Why is no real title available?)
- scientific article; zbMATH DE number 3049708 (Why is no real title available?)
- A NEW MEASURE OF RANK CORRELATION
- A general framework for distance-based consensus in ordinal ranking models
- 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 tree-based missing data imputation and data fusion within the statistical learning paradigm
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Generalized permutation polytopes and exploratory graphical methods for ranked data
- Geometric representation of association between categories
- Metric methods for analyzing partially ranked data
- Mixtures of distance-based models for ranking data
- Multistage Ranking Models
- Multivariate data analysis and modeling through classification and regression trees
- Preference Structures. II: Distances Between Asymmetric Relations
- Preference structures I: Distances between transitive preference relations†
- Preferential Arrangements
- Priority Ranking and Consensus Formation
- Probability models on rankings
- Social Preference Orderings and Majority Rule
- Social choice and individual values
- The median procedure in cluster analysis and social choice theory
Cited in
(22)- Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings
- Copula-based non-metric unfolding on augmented data matrix
- On weakly and strongly popular rankings
- Fixed-parameter algorithms for Kemeny rankings
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Partial evaluation in rank aggregation problems
- Decomposition procedures in problems of construction of strict resulting ranking of objects in the form of the Kemeny-Snell median
- Approaching the rank aggregation problem by local search-based metaheuristics
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
- Median constrained bucket order rank aggregation
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- ConsRank
- A new position weight correlation coefficient for consensus ranking process without ties
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
- The Bradley-Terry regression trunk approach for modeling preference data with small trees
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- Comparing boosting and bagging for decision trees of rankings
- A new approach for identifying the Kemeny median ranking
- Bayesian taut splines for estimating the number of modes
- Weighted distance-based trees for ranking data
This page was built for publication: Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q62323)
