On strict ranking by pairwise comparisons
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910119932985344 |
|---|---|
| author | Magnot, Jean-Pierre |
| author_facet | Magnot, Jean-Pierre |
| contents | We attack the problem of getting a strict ranking (i.e. a ranking without equally ranked items) of $n$ items from a pairwise comparisons matrix. Basic structures are described, a first heuristical approach based on a condition, the $\mathcal{R}-$condition, is proposed. Analyzing the limits of this ranking procedure, we finish with a minimization problem which can be applied to a wider class of pairwise comparisons matrices. If solved, it produces consistent pairwise comparisons that produce a strict ranking. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_14738 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On strict ranking by pairwise comparisons Magnot, Jean-Pierre Information Theory 90B50, 81T13, 91B06 We attack the problem of getting a strict ranking (i.e. a ranking without equally ranked items) of $n$ items from a pairwise comparisons matrix. Basic structures are described, a first heuristical approach based on a condition, the $\mathcal{R}-$condition, is proposed. Analyzing the limits of this ranking procedure, we finish with a minimization problem which can be applied to a wider class of pairwise comparisons matrices. If solved, it produces consistent pairwise comparisons that produce a strict ranking. |
| title | On strict ranking by pairwise comparisons |
| topic | Information Theory 90B50, 81T13, 91B06 |
| url | https://arxiv.org/abs/2501.14738 |