Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach R package RankAggSIgFUR version 1.0.0 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>. Software Depends: R (>= 3.5.0) Imports: Rfast, combinat, data.table, plyr Suggests: testthat (>= 3.0.0) Rakhi Singh <agrakhi@gmail.com> Comprehensive R Archive Network (CRAN) Hannah Parker [aut], Rakhi Singh [cre, aut] (ORCID: <https://orcid.org/0000-0003-3469-295X>), Prakash Singh Badal [aut] (ORCID: <https://orcid.org/0000-0003-4097-8444>) GPL (>= 3) 2023-06-19 application/tgz https://CRAN.R-project.org/package=RankAggSIgFUR doi:10.32614/CRAN.package.RankAggSIgFUR