How to transform all multiple solutions of the Kemeny Ranking Problem into a single solution; Journal of Physics: Conference Series; Vol. 1379
| Parent link: | Journal of Physics: Conference Series Vol. 1379.— 2019.— [012053, 6 p.] |
|---|---|
| Autor principal: | |
| Autor corporatiu: | |
| Altres autors: | , |
| Sumari: | Title screen Preference aggregation as a problem of a single consensus ranking determination, using Kemeny rule, for m rankings, including ties, of n alternatives is considered in the paper. The Kemeny Ranking Problem (KRP) may have considerably more than one optimal solutions (strict orders or permutations of the alternatives) and, hence, special efforts to deal with this phenomenon are needed. In the paper, there is proposed an efficient formal rule for convolution of the N multiple optimal permutations, the output profile Я(N, n), into an exact single final consensus ranking, which can include ties. The convolution rule is as follows: in the final consensus ranking, alternatives are arranged in ascending order of their rank sums (total ranks) calculated for the output profile Я; some two alternatives are considered to be tolerant if they have the same rank sums in Я. The equivalent convolution rule can be also applied as follows: in the final consensus ranking, alternatives are arranged in descending order of row sums (total scores) calculated for a tournament table built for Я; some two alternatives are deemed to be tolerant if they have the same row sums. It is shown that, for any alternative, its total rank and total score are equal in sum to the output profile dimension NЧn. The convolution rules are validated using Borda count. |
| Idioma: | anglès |
| Publicat: |
2019
|
| Matèries: | |
| Accés en línia: | http://earchive.tpu.ru/handle/11683/64881 https://doi.org/10.1088/1742-6596/1379/1/012053 |
| Format: | MixedMaterials Electrònic Capítol de llibre |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=662382 |
MARC
| LEADER | 00000naa2a2200000 4500 | ||
|---|---|---|---|
| 001 | 662382 | ||
| 005 | 20250130103038.0 | ||
| 035 | |a (RuTPU)RU\TPU\network\33519 | ||
| 090 | |a 662382 | ||
| 100 | |a 20200730d2019 k||y0rusy50 ba | ||
| 101 | 0 | |a eng | |
| 102 | |a GB | ||
| 135 | |a drcn ---uucaa | ||
| 181 | 0 | |a i |b d | |
| 182 | 0 | |a b | |
| 183 | 0 | |a cr |2 RDAcarrier | |
| 200 | 1 | |a How to transform all multiple solutions of the Kemeny Ranking Problem into a single solution |f S. V. Muravyov (Murav’ev), P. F. Baranov, E. Y. Emelyanova | |
| 203 | |a Текст |c электронный | ||
| 300 | |a Title screen | ||
| 330 | |a Preference aggregation as a problem of a single consensus ranking determination, using Kemeny rule, for m rankings, including ties, of n alternatives is considered in the paper. The Kemeny Ranking Problem (KRP) may have considerably more than one optimal solutions (strict orders or permutations of the alternatives) and, hence, special efforts to deal with this phenomenon are needed. In the paper, there is proposed an efficient formal rule for convolution of the N multiple optimal permutations, the output profile Я(N, n), into an exact single final consensus ranking, which can include ties. The convolution rule is as follows: in the final consensus ranking, alternatives are arranged in ascending order of their rank sums (total ranks) calculated for the output profile Я; some two alternatives are considered to be tolerant if they have the same rank sums in Я. The equivalent convolution rule can be also applied as follows: in the final consensus ranking, alternatives are arranged in descending order of row sums (total scores) calculated for a tournament table built for Я; some two alternatives are deemed to be tolerant if they have the same row sums. It is shown that, for any alternative, its total rank and total score are equal in sum to the output profile dimension NЧn. The convolution rules are validated using Borda count. | ||
| 461 | 0 | |0 (RuTPU)RU\TPU\network\3526 |t Journal of Physics: Conference Series | |
| 463 | |t Vol. 1379 |o Joint IMEKO TC1-TC7-TC13-TC18 Symposium, 2–5 July 2019, St Petersburg, Russian Federation |v [012053, 6 p.] |d 2019 | ||
| 610 | 1 | |a электронный ресурс | |
| 610 | 1 | |a труды учёных ТПУ | |
| 610 | 1 | |a ранжирование Кемени | |
| 610 | 1 | |a свертка | |
| 610 | 1 | |a оптимальные решения | |
| 700 | 1 | |a Muravyov (Murav’ev) |b S. V. |c specialist in the field of control and measurement equipment |c Professor of Tomsk Polytechnic University,Doctor of technical sciences |f 1954- |g Sergey Vasilyevich |3 (RuTPU)RU\TPU\pers\31262 |9 15440 | |
| 701 | 1 | |a Baranov |b P. F. |c specialist in the field of control and measurement equipment |c Associate Professor of Tomsk Polytechnic University, Candidate of technical sciences |f 1987- |g Pavel Fedorovich |3 (RuTPU)RU\TPU\pers\34618 |9 17980 | |
| 701 | 1 | |a Emelyanova |b E. Y. |c specialist in the field of control and measurement equipment |c Senior Lecturer of Tomsk Polytechnic University |f 1984- |g Ekaterina Yurevna |3 (RuTPU)RU\TPU\pers\41538 |9 21415 | |
| 712 | 0 | 2 | |a Национальный исследовательский Томский политехнический университет |b Инженерная школа информационных технологий и робототехники |b Отделение автоматизации и робототехники |3 (RuTPU)RU\TPU\col\23553 |
| 801 | 2 | |a RU |b 63413507 |c 20210324 |g RCR | |
| 856 | 4 | |u http://earchive.tpu.ru/handle/11683/64881 |z http://earchive.tpu.ru/handle/11683/64881 | |
| 856 | 4 | |u https://doi.org/10.1088/1742-6596/1379/1/012053 |z https://doi.org/10.1088/1742-6596/1379/1/012053 | |
| 942 | |c CF | ||