get_sub_rkgs

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.

internal

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>.

Rakhi Singh

RankAggSIgFUR

Polynomially Bounded Rank Aggregation under Kemeny's Axiomatic
Approach

Hannah Parker

Prakash Singh Badal

get_sub_rkgs function

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

Arguments

Determine a Subset of Rankings for Greedy Algorithm — get_sub_rkgs

<dl>

<dt>seed_rkg</dt>
<dd>a vector containing the initial ranking on which subsequent moves will be based.</dd>


<dt>move_ind</dt>
<dd>an integer representing the index of the object to be moved.</dd>


<dt>search_radius</dt>
<dd>a positive integer of the maximum shift allowed to increase or decrease
the rank of the object.</dd>

</dl>

get_sub_rkgs: Determine a Subset of Rankings for Greedy Algorithm

Description

Usage

Value

Arguments

See Also