Using extension sets to aggregate partial rankings in a flexible setting

DOI10.1016/j.amc.2016.06.005zbMath1410.91165MaRDI 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 ranking; rank aggregation problem; Kemeny ranking problem; Borda method; ranking with ties; extension set

Mathematics Subject Classification ID

91B06: Decision theory

68T05: Learning and adaptive systems in artificial intelligence

62F07: Statistical ranking and selection procedures

Related Items

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

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