BBconsensus: Find the first approximation to the consensus ranking. Most of the time the output
is a solution, maybe not unique
Description
Find a first approximation to the consensus ranking.
Usage
BBconsensus(RR, cij, FULL=FALSE)
Arguments
RR
Candidate to be the consensus ranking
cij
Combined input matrix of the data set
FULL
Default FULL=FALSE. If FULL=TRUE, the searching is limited to the space of complete rankings. TRUE=TRUE if the function is called by BBFULL algorithm.
Value
consa first approximation to be the consensus ranking
penpenalty value
References
Amodio, S., D'Ambrosio, A. & Siciliano, R (2015). Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach. European Journal of Operational Research. DOI: 10.1016/j.ejor.2015.08.048.