Description Usage Arguments Value Author(s) References See Also Examples

View source: R/ALL.r View source: R/QuickCons.R

The Quick algorithm finds up to 4 solutions. Solutions reached are most of the time optimal solutions.

1 |

`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. Alternatively X can contain the rankings observed only once in the sample. In this case the argument Wk must be used |

`Wk` |
Optional: the frequency of each ranking in the data |

`FULL` |
Default FULL=FALSE. If FULL=TRUE, the searching is limited to the space of full rankings. |

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

a "list" containing the following components:

Consensus | the Consensus Ranking | |

Tau | averaged TauX rank correlation coefficient | |

Eltime | Elapsed time in seconds |

Antonio D'Ambrosio [email protected] and Sonia Amodio [email protected]

Amodio, S., D'Ambrosio, A. and Siciliano, R. (2016). Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach. European Journal of Operational Research, 249(2), 667-676.

`FASTcons`

FAST algorithm.

`QuickCons`

Quick algorithm.

1 2 |

ConsRank documentation built on May 30, 2017, 3:05 a.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.