A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
From MaRDI portal
Publication:62336
DOI10.1016/j.cor.2017.01.017zbMath1391.90650OpenAlexW2582225880WikidataQ56476090 ScholiaQ56476090MaRDI QIDQ62336
Carmela Iorio, Roberta Siciliano, Giulio Mazzeo, Antonio D'Ambrosio, Carmela Iorio, Giulio Mazzeo, Roberta Siciliano
Publication date: June 2017
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.2017.01.017
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Group preferences (91B10) Social choice (91B14)
Related Items
Comparing boosting and bagging for decision trees of rankings ⋮ Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings ⋮ Median constrained bucket order rank aggregation ⋮ Approaching the rank aggregation problem by local search-based metaheuristics ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ A family of distances for preference-approvals ⋮ The Bradley-Terry regression trunk approach for modeling preference data with small trees ⋮ 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 ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
Uses Software
Cites Work
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Optimization by Simulated Annealing
- A generative model for rank data based on insertion sort algorithm
- 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
- Tackling the rank aggregation problem with evolutionary algorithms
- Mixtures of distance-based models for ranking data
- A randomized approximation algorithm for computing bucket orders
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Generalized permutation polytopes and exploratory graphical methods for ranked data
- Geometric representation of association between categories
- A preference aggregation method through the estimation of utility intervals
- Model-based clustering for multivariate partial ranking data
- Differential evolution: A handbook for global permutation-based combinatorial optimization. With CD-ROM
- Modern multidimensional scaling. Theory and applications.
- 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
- Multistage Ranking Models
- A NEW MEASURE OF RANK CORRELATION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
