Find the first approximation to the consensus ranking. Most of the time the output is a solution, maybe not unique

Share:

Description

Find a first approximation to the consensus ranking.

Usage

1
BBconsensus(RR, cij, FULL=FALSE, PS=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. FULL=TRUE if the function is called by BBFULL algorithm.

PS

Default PS=FALSE. If PS=TRUE the number of evaluated branches is diplayed

Value

cons

a first approximation to be the consensus ranking

pen

penalty value

Author(s)

Antonio D'Ambrosio <antdambr@unina.it>

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.

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.