kemenydesign

<p>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 represented by the columns.</p>

<p>Define a design matrix to compute Kemeny distance</p>

Compute the median ranking according to the Kemeny's axiomatic approach.
Rankings can or cannot contain ties, rankings can be both complete or incomplete.
The package contains both branch-and-bound algorithms and heuristic solutions recently proposed.
The package also provide some useful utilities for deal with preference rankings.
Essential references:
Emond, E.J., and Mason, D.W. (2002) <doi:10.1002/mcda.313>;
D'Ambrosio, A., Amodio, S., and Iorio, C. (2015) <doi:10.1285/i20705948v8n2p198>;
Amodio, S., D'Ambrosio, A., and Siciliano R. (2016) <doi:10.1016/j.ejor.2015.08.048>;
D'Ambrosio, A., Mazzeo, G., Iorio, C., and Siciliano, R. (2017) <doi:10.1016/j.cor.2017.01.017>.

Antonio DAmbrosio

kemenydesign: Auxiliary function

Description

Usage

Arguments

Value

References