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>.
[email protected] low health (33/100) — consider alternatives
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/cran/RankAggSIgFURFirst published · 2023-06-19 05:09:15
Last updated · 2023-06-19T02:40:09+00:00