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.
- Version1.0.0
- R versionunknown
- LicenseGPL (≥ 3)
- Needs compilation?Yes
- Last release06/19/2023
Documentation
Team
Rakhi Singh
Hannah Parker
Show author detailsRolesAuthorPrakash Singh Badal
Insights
Last 30 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN