ConsRank (version 1.0.1)

BBFULL: Branch and Bound algorithm to find the median ranking in the space of full (or complete) rankings.

Description

Branch-and-bound algorithm to find consensus ranking as definned by D'Ambrosio et al. (2015). If the number of objects to be ranked is large (greater than 20 or 25), it can work for very long time. Use either QuickCons or FASTcons with the option FULL=TRUE instead

Usage

BBFULL(X,Wk=NULL,PS=TRUE)

Arguments

X

A N by M data matrix, in which there are N judges and M objects to be judged. Each row is a ranking of the objects which are represented by the columns. The data matrix MUST contain only full rankings, or incomplete rankings, without ties.\ Alternatively

Wk

Optional: the frequency of each ranking in the data

PS

If PS=TRUE, on the screen some information about how many branches are processed are displayed

Value

• Consensus
  Consensus ranking
• Tau
  Averaged Kendall's Tau
• Eltime
  Elapsed time in seconds

Details

If the objects to be ranked is large (>15-20), it can take long time to finde the solutions

References

D'Ambrosio, A., Amodio, S. & Iorio, C. (2015). Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings. Technical report, University of Naples Federico II.

See Also

FASTcons QuickCons

Examples

data(APAFULL)
CR=BBFULL(APAFULL)