RankAggSIgFUR - Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach
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>.
Last updated 2 years ago
2.70 score 3 scripts 184 downloads