RankAggSIgFUR (Q107992)

From MaRDI portal
Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach
Language Label Description Also known as
English
RankAggSIgFUR
Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach

    Statements

    0 references
    0.1.0
    21 May 2022
    0 references
    1.0.0
    19 June 2023
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references