Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic
Approach
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")))
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>.
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>)

Vasyl Pihur <v0pihu01@louisvill.edu>,
Somnath Datta <somnath.datta@louisville.edu>,
Susmita Datta <susmita.datta@louisville.edu>
This package performs aggregation of ordered lists based on the ranks using three different algorithms: Cross-Entropy Monte Carlo algorithm, Genetic algorithm, and a brute force algorithm (for small problems)

Vasyl Pihur <v0pihu01@louisville.edu>,
Somnath Datta <somnath.datta@louisville.edu>,
Susmita Datta <susmita.datta@louisville.edu>
This package performs aggregation of ordered lists based on the ranks using several different algorithms: Borda count, Cross-Entropy Monte Carlo algorithm, Genetic algorithm, and a brute force algorithm (for small problems)

Vasyl Pihur <vpihur@gmail.com>, Somnath Datta
<somnath.datta@louisville.edu>, Susmita Datta
<susmita.datta@louisville.edu>
This package performs aggregation of ordered lists based
on the ranks using several different algorithms: Borda count,
Cross-Entropy Monte Carlo algorithm, Genetic algorithm, and a
brute force algorithm (for small problems)

Performs aggregation of ordered lists based
on the ranks using several different algorithms:
Cross-Entropy Monte Carlo algorithm, Genetic algorithm, and a
brute force algorithm (for small problems).