RankAggSIgFUR: Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach
Hannah Parker, Rakhi Singh, Prakash Singh Badal · 2022
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) .