Package: RankAggSIgFUR
Title: Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic
        Approach
Version: 1.0.0
Authors@R: c(
   person("Hannah", "Parker", email = "parkerhannah09@gmail.com", role = "aut"),
   person("Rakhi", "Singh", email = "agrakhi@gmail.com", role = c("cre", "aut"), comment = c(ORCID = "0000-0003-3469-295X")),
   person("Prakash Singh", "Badal", email= "aprakashn@gmail.com", role = "aut", comment = c(ORCID = "0000-0003-4097-8444")))
Description: 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>.
License: GPL (>= 3)
Encoding: UTF-8
Roxygen: list(markdown = TRUE)
RoxygenNote: 7.2.3
Depends: R (>= 3.5.0)
LazyData: true
Imports: Rfast, combinat, data.table, plyr
Suggests: testthat (>= 3.0.0)
Config/testthat/edition: 3
NeedsCompilation: yes
URL: https://github.com/prakashvs613/RankAggSIgFUR
BugReports: https://github.com/prakashvs613/RankAggSIgFUR/issues
Packaged: 2026-06-13 06:16:53 UTC; root
Author: Hannah Parker [aut], Rakhi Singh [cre, aut]
        (<https://orcid.org/0000-0003-3469-295X>), Prakash Singh Badal
        [aut] (<https://orcid.org/0000-0003-4097-8444>)
Maintainer: Rakhi Singh <agrakhi@gmail.com>
Config/pak/sysreqs: make
Repository: https://prakashvs613.r-universe.dev
Date/Publication: 2023-06-19 01:18:22 UTC
RemoteUrl: https://github.com/prakashvs613/rankaggsigfur
RemoteRef: HEAD
RemoteSha: 3c9e83da7940a0ce5ea8617b0143cef49d9c474a