Median constrained bucket order rank aggregation
| Autor: | Antonio D’Ambrosio, Roberta Siciliano, Carmela Iorio, Michele Staiano |
|---|---|
| Přispěvatelé: | D'Ambrosio, Antonio, Iorio, Carmela, Staiano, Michele, Siciliano, Roberta |
| Rok vydání: | 2019 |
| Předmět: |
Statistics and Probability
Mathematical optimization Computer science 05 social sciences Rank (computer programming) Frame (networking) Aggregation problem 01 natural sciences Triage Tied rankings Median ranking Kemeny distance Triage prioritization Median ranking Set (abstract data type) Triage prioritization 010104 statistics & probability Computational Mathematics Ranking Order (exchange) 0502 economics and business 0101 mathematics Statistics Probability and Uncertainty Kemeny distance Tied rankings Axiom 050205 econometrics |
| Zdroj: | Computational Statistics |
| ISSN: | 1613-9658 0943-4062 |
| DOI: | 10.1007/s00180-018-0858-z |
| Popis: | The rank aggregation problem can be summarized as the problem of aggregating individual preferences expressed by a set of judges to obtain a ranking that represents the best synthesis of their choices. Several approaches for handling this problem have been proposed and are generally linked with either axiomatic frameworks or alternative strategies. In this paper, we present a new definition of median ranking and frame it within the Kemeny’s axiomatic framework. Moreover, we show the usefulness of our approach in a practical case about triage prioritization. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink