RankAggSIgFUR

CRANRankAggSIgFURMaRDI QIDQ107992

Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach

Hannah Parker, Prakash Singh Badal

Last update: 19 June 2023

Copyright license: GNU General Public License

Software version identifier: 0.1.0, 1.0.0

Description

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>.

Cites work

• Efficient algorithms using subiterative convergence for Kemeny ranking problem

This page was built for software: RankAggSIgFUR