Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
From MaRDI portal
Publication:62323
DOI10.1016/j.ejor.2015.08.048zbMath1346.91065arXiv1502.06498OpenAlexW1437742013MaRDI QIDQ62323
A. D’Ambrosio, Sonia Amodio, Antonio D'Ambrosio, Roberta Siciliano, Sonia Amodio
Publication date: March 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06498
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Individual preferences (91B08)
Related Items (17)
Comparing boosting and bagging for decision trees of rankings ⋮ A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances ⋮ Partial evaluation in rank aggregation problems ⋮ A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings ⋮ Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings ⋮ Median constrained bucket order rank aggregation ⋮ On weakly and strongly popular rankings ⋮ Approaching the rank aggregation problem by local search-based metaheuristics ⋮ The Bradley-Terry regression trunk approach for modeling preference data with small trees ⋮ Weighted distance-based trees for ranking data ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ 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 ⋮ ConsRank ⋮ 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 ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accurate tree-based missing data imputation and data fusion within the statistical learning paradigm
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- Mixtures of distance-based models for ranking data
- Metric methods for analyzing partially ranked data
- The median procedure in cluster analysis and social choice theory
- Probability models on rankings
- A general framework for distance-based consensus in ordinal ranking models
- Generalized permutation polytopes and exploratory graphical methods for ranked data
- Multivariate data analysis and modeling through classification and regression trees
- Geometric representation of association between categories
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Preferential Arrangements
- Priority Ranking and Consensus Formation
- Preference structures I: Distances between transitive preference relations†
- Preference Structures. II: Distances Between Asymmetric Relations
- A new rank correlation coefficient with application to the consensus ranking problem
- Social Preference Orderings and Majority Rule
- Multistage Ranking Models
- A NEW MEASURE OF RANK CORRELATION
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
