get_sub_rkgs: Determine a Subset of Rankings for Greedy Algorithm

In RankAggSIgFUR: Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic Approach

Determine a Subset of Rankings for Greedy Algorithm

Description

This function creates the new rankings for Greedy Algorithm after moving an object to a higher and lower rank within the search radius. Cyclical moving is permitted in the event of overflow.

Usage

get_sub_rkgs(seed_rkg, move_ind, search_radius)

Arguments

seed_rkg	a vector containing the initial ranking on which subsequent moves will be based.
move_ind	an integer representing the index of the object to be moved.
search_radius	a positive integer of the maximum shift allowed to increase or decrease the rank of the object.

Value

A matrix of the subset of rankings, with each row as a new ranking with the moved object.

See Also

rap_greedy_alg

RankAggSIgFUR documentation built on July 9, 2023, 7:26 p.m.