Using extension sets to aggregate partial rankings in a flexible setting

DOI10.1016/j.amc.2016.06.005zbMath1410.91165OpenAlexW2497663052MaRDI QIDQ1733690

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

partial rankingrank aggregation problemKemeny ranking problemBorda methodranking with tiesextension set

Mathematics Subject Classification ID

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

Related Items (3)

Partial evaluation in rank aggregation problems ⋮ Approaching the rank aggregation problem by local search-based metaheuristics ⋮ Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments with Kemeny ranking: What works when?
• The complexity of Kemeny elections
• Tackling the rank aggregation problem with evolutionary algorithms
• A randomized approximation algorithm for computing bucket orders
• Metric methods for analyzing partially ranked data
• Voting schemes for which it can be difficult to tell who won the election
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• The original Borda count and partial voting
• Comparing Top k Lists
• Rank Aggregation: Together We're Strong
• A NEW MEASURE OF RANK CORRELATION
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Aggregating inconsistent information

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