000 | 03640nlm2a2200385 4500 | ||
---|---|---|---|
001 | 662382 | ||
005 | 20231030041819.0 | ||
035 | _a(RuTPU)RU\TPU\network\33519 | ||
090 | _a662382 | ||
100 | _a20200730a2019 k y0engy50 ba | ||
101 | 0 | _aeng | |
102 | _aGB | ||
105 | _ay z 100zy | ||
135 | _adrcn ---uucaa | ||
181 | 0 | _ai | |
182 | 0 | _ab | |
200 | 1 |
_aHow to transform all multiple solutions of the Kemeny Ranking Problem into a single solution _fS. V. Muravyov (Murav’ev), P. F. Baranov, E. Y. Emelyanova |
|
203 |
_aText _celectronic |
||
300 | _aTitle screen | ||
330 | _aPreference 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 _tJournal of Physics: Conference Series |
|
463 |
_tVol. 1379 _oJoint IMEKO TC1-TC7-TC13-TC18 Symposium, 2–5 July 2019, St Petersburg, Russian Federation _v[012053, 6 p.] _d2019 |
||
610 | 1 | _aэлектронный ресурс | |
610 | 1 | _aтруды учёных ТПУ | |
610 | 1 | _aранжирование Кемени | |
610 | 1 | _aсвертка | |
610 | 1 | _aоптимальные решения | |
700 | 1 |
_aMuravyov (Murav’ev) _bS. V. _cspecialist in the field of control and measurement equipment _cProfessor of Tomsk Polytechnic University,Doctor of technical sciences _f1954- _gSergey Vasilyevich _2stltpush _3(RuTPU)RU\TPU\pers\31262 |
|
701 | 1 |
_aBaranov _bP. F. _cspecialist in the field of control and measurement equipment _cAssociate Professor of Tomsk Polytechnic University, Candidate of technical sciences _f1987- _gPavel Fedorovich _2stltpush _3(RuTPU)RU\TPU\pers\34618 |
|
701 | 1 |
_aEmelyanova _bE. Y. _cspecialist in the field of control and measurement equipment _cSenior Lecturer of Tomsk Polytechnic University _f1984- _gEkaterina Yurevna _2stltpush _3(RuTPU)RU\TPU\pers\41538 |
|
712 | 0 | 2 |
_aНациональный исследовательский Томский политехнический университет _bИнженерная школа информационных технологий и робототехники _bОтделение автоматизации и робототехники _h7952 _2stltpush _3(RuTPU)RU\TPU\col\23553 |
801 | 2 |
_aRU _b63413507 _c20210324 _gRCR |
|
856 | 4 | _uhttp://earchive.tpu.ru/handle/11683/64881 | |
856 | 4 | _uhttps://doi.org/10.1088/1742-6596/1379/1/012053 | |
942 | _cCF |