Using extension sets to aggregate partial rankings in a flexible setting
type: Item
instance of: scholarly article
title: Using extension sets to aggregate partial rankings in a flexible setting
zbMATH Open document ID: 1410.91165
author: Juan A. Aledo
author: David Molina
author: José A. Gámez
published in: Applied Mathematics and Computation
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 62F07
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 7040338
zbMATH Keywords: rank aggregation problem
zbMATH Keywords: Kemeny ranking problem
zbMATH Keywords: Borda method
zbMATH Keywords: extension set
zbMATH Keywords: partial ranking
zbMATH Keywords: ranking with ties
MaRDI profile type: Publication
full work available at URL: j.amc.2016.06.005
OpenAlex ID: W2497663052
cites work: Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
cites work: Aggregating inconsistent information
cites work: Tackling the rank aggregation problem with evolutionary algorithms
cites work: Experiments with Kemeny ranking: What works when?
cites work: Voting schemes for which it can be difficult to tell who won the election
cites work: Q4243442
cites work: Ordering by weighted number of wins gives a good ranking for weighted tournaments
cites work: Metric methods for analyzing partially ranked data
cites work: The original Borda count and partial voting
cites work: Comparing Top k Lists
cites work: Q3806565
cites work: Q3096211
cites work: The complexity of Kemeny elections
cites work: Q4187195
cites work: Q5671815
cites work: A NEW MEASURE OF RANK CORRELATION
cites work: Rank Aggregation: Together We're Strong
cites work: A randomized approximation algorithm for computing bucket orders
cites work: Q5396644
DOI: 10.1016/J.AMC.2016.06.005
description: scientific article; zbMATH DE number 7040338