Crandore Hub

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

Versions across snapshots

VersionRepositoryFileSize
1.0.0 rolling linux/jammy R-4.5 RankAggSIgFUR_1.0.0.tar.gz 104.5 KiB
1.0.0 rolling linux/noble R-4.5 RankAggSIgFUR_1.0.0.tar.gz 104.3 KiB
1.0.0 rolling source/ R- RankAggSIgFUR_1.0.0.tar.gz 37.1 KiB
1.0.0 latest linux/jammy R-4.5 RankAggSIgFUR_1.0.0.tar.gz 104.5 KiB
1.0.0 latest linux/noble R-4.5 RankAggSIgFUR_1.0.0.tar.gz 104.3 KiB
1.0.0 latest source/ R- RankAggSIgFUR_1.0.0.tar.gz 37.1 KiB
1.0.0 2026-04-26 source/ R- RankAggSIgFUR_1.0.0.tar.gz 37.1 KiB
1.0.0 2026-04-23 source/ R- RankAggSIgFUR_1.0.0.tar.gz 37.1 KiB
1.0.0 2026-04-09 windows/windows R-4.5 RankAggSIgFUR_1.0.0.zip 108.5 KiB
1.0.0 2025-04-20 source/ R- RankAggSIgFUR_1.0.0.tar.gz 37.1 KiB

Dependencies (latest)

Imports

Suggests