Nothing
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>.
Getting started
Browse package contents
Package details |
|
|---|---|
| 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> |
| License | GPL (>= 3) |
| Version | 1.0.0 |
| URL | https://github.com/prakashvs613/RankAggSIgFUR |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the RankAggSIgFUR package in your browser
Any scripts or data that you put into this service are public.
