CRAN/E | RankAggSIgFUR

RankAggSIgFUR

Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach

Installation

About

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.

github.com/prakashvs613/RankAggSIgFUR
Bug report File report

Key Metrics

Version 1.0.0
R ≥ 3.5.0
Published 2023-06-19 320 days ago
Needs compilation? yes
License GPL (≥ 3)
CRAN checks RankAggSIgFUR results

Downloads

Yesterday 7 0%
Last 7 days 50 -35%
Last 30 days 208 -8%
Last 90 days 599 -28%
Last 365 days 2.702 +71%

Maintainer

Maintainer

Rakhi Singh

agrakhi@gmail.com

Authors

Hannah Parker

aut

Rakhi Singh

cre / aut

Prakash Singh Badal

aut

Material

README
NEWS
Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

RankAggSIgFUR archive

Depends

R ≥ 3.5.0

Imports

Rfast
combinat
data.table
plyr

Suggests

testthat ≥ 3.0.0