RankAggSIgFUR (Q107992)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: RankAggSIgFUR |
Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | RankAggSIgFUR |
Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach |
Statements
19 June 2023
0 references
Polynomially bounded algorithms to aggregate complete rankings under Kemeny's axiomatic framework. 'RankAggSIgFUR' (pronounced as rank-agg-cipher) contains two heuristics algorithms: FUR and SIgFUR. For details, please see Badal and Das (2018) <doi:10.1016/j.cor.2018.06.007>.
0 references
