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

Version: 1.0.0
Depends: R (≥ 3.5.0)
Imports: Rfast, combinat, data.table, plyr
Suggests: testthat (≥ 3.0.0)
Published: 2023-06-19
DOI: 10.32614/CRAN.package.RankAggSIgFUR
Author: Hannah Parker [aut], Rakhi Singh ORCID iD [cre, aut], Prakash Singh Badal ORCID iD [aut]
Maintainer: Rakhi Singh <agrakhi at gmail.com>
BugReports: https://github.com/prakashvs613/RankAggSIgFUR/issues
License: GPL (≥ 3)
URL: https://github.com/prakashvs613/RankAggSIgFUR
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: RankAggSIgFUR results


Reference manual: RankAggSIgFUR.pdf


Package source: RankAggSIgFUR_1.0.0.tar.gz
Windows binaries: r-devel: RankAggSIgFUR_1.0.0.zip, r-release: RankAggSIgFUR_1.0.0.zip, r-oldrel: RankAggSIgFUR_1.0.0.zip
macOS binaries: r-release (arm64): RankAggSIgFUR_1.0.0.tgz, r-oldrel (arm64): RankAggSIgFUR_1.0.0.tgz, r-release (x86_64): RankAggSIgFUR_1.0.0.tgz, r-oldrel (x86_64): RankAggSIgFUR_1.0.0.tgz
Old sources: RankAggSIgFUR archive


Please use the canonical form https://CRAN.R-project.org/package=RankAggSIgFUR to link to this page.