Using extension sets to aggregate partial rankings in a flexible setting

DOI10.1016/J.AMC.2016.06.005MaRDI QIDQ1733690zbMATH OpenOpenAlexFDO

Authors Juan A. Aledo, David Molina, José A. Gámez

Publication date 21 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2016.06.005

zbMATH Keywords

rank aggregation problempartial rankingKemeny ranking problemBorda methodranking with tiesextension set

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Statistical ranking and selection procedures (62F07) Decision theory (91B06)

Recommendations

• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Ranking sets of interacting objects via semivalues
• Median constrained bucket order rank aggregation
• An extended Mallows model for ranked data aggregation

Cites work

• scientific article; zbMATH DE number 4076317 (Why is no real title available?)
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• scientific article; zbMATH DE number 1288298 (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 randomized approximation algorithm for computing bucket orders
• Aggregating inconsistent information: ranking and clustering
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
• Clustering algorithms for chains
• Comparing Top k Lists
• Experiments with Kemeny ranking: What works when?
• Metric methods for analyzing partially ranked data
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Rank aggregation: together we're strong
• Tackling the rank aggregation problem with evolutionary algorithms
• The complexity of Kemeny elections
• The original Borda count and partial voting
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(5)

• A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
• Partial evaluation in rank aggregation problems
• Multivariate Spearman's \(\rho\) for aggregating ranks using copulas
• Approaching the rank aggregation problem by local search-based metaheuristics

This page was built for publication: Using extension sets to aggregate partial rankings in a flexible setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733690)