Compute the median ranking according the Kemeny's axiomatic approach. Rankings can or cannot contain ties, rankings can be both complete or incomplete.
|Author||Antonio D'Ambrosio <firstname.lastname@example.org>, Sonia Amodio <email@example.com>|
|Date of publication||2015-09-29 20:38:03|
|Maintainer||Antonio D'Ambrosio <firstname.lastname@example.org>|
APAFULL: American Psychological Association dataset, full version
APAred: American Psychological Association dataset, reduced version...
BBconsensus: Find the first approximation to the consensus ranking. Most...
BBconsensus2: Core function in computing consensus ranking as defined by...
BBFULL: Branch and Bound algorithm to find the median ranking in the...
branches: Auxliary code recalled by other routines
BU: Brook and Upton data
combinpmatr: Combined input matrix of a data set
ConsRank-package: Compute the Median Ranking(s) According to the Kemeny's...
EMCons: Branch-and-bound algorithm to find consensus (median) ranking...
EMD: Emond and Mason data
FASTcons: FAST algorithm to find consensus (median) ranking according...
findbranches: Auxiliary function
findconsensusBB: Find a first ranking candidate to be the cinsensus ranking
German: German political goals
Idea: Idea data set
kemenyd: Kemeny distance
kemenydesign: Auxiliary function
labels: Transform a ranking into a ordering.
Penalty: Auxiliary function
PenaltyBB2: Auxiliary function
polyplot: Plot rankings on a permutation polytope of 3 o 4 objects...
QuickCons: Quick algorithm to find up to 4 solutions to the consensus...
reordering: Auxiliary function
ReorderingBB: Auxiliary function
scorematrix: Score matrix according Emond and Mason (2002)
sports: sports data
tabulaterows: Frequency distribution of a sample of rankings
Tau_X: Tau exstension rank correlation coefficient
USAranks: USA rank data