Kemeny rule for preference aggregation: Reducing all exact solutions to a single one

Kemeny rule for preference aggregation: Reducing all exact solutions to a single one

Podrobná bibliografie
Parent link:Measurement
Vol. 182.— 2021.— [109403, 26 p.]
Hlavní autor: Muravyov (Murav’ev) S. V. Sergey Vasilyevich
Korporativní autor: Национальный исследовательский Томский политехнический университет Инженерная школа информационных технологий и робототехники Отделение автоматизации и робототехники
Další autoři: Emelyanova E. Y. Ekaterina Yurevna
Shrnutí:Title screen
Preference aggregation as a single consensus ranking (CR) determination, using Kemeny rule, for an input profile consisting of m rankings, including ties, of n alternatives is used in multidimensional ordinal scale measurements, interval fusion with preference aggregation (IF&PA) technique, and various machine learning applications. In spite of its NP-hardness, the Kemeny rule can be fruitfully applied at the problem size n < 20, using branch and bound method, however, it can lead not to a single, but N optimal (exact) solutions (CRs), which are strict orders of the alternatives and form an output profile (OP). An efficient formal rule based on specific parameters of a weighted tournament matrix, constructed for the OP, is proposed to convolute the OP into an exact single final CR, which can include ties. The convolution rule is validated using Borda count, applied to the OP, and the notion of “betweenness” relation over rankings.
Режим доступа: по договору с организацией-держателем ресурса
Jazyk:angličtina
Vydáno: 2021
Témata:
электронный ресурс
труды учёных ТПУ
preference aggregation
weak order
kemeny rule
multiple exact solutions
weighted tournament
borda count
агрегирование предпочтений
On-line přístup:https://doi.org/10.1016/j.measurement.2021.109403
Médium: Elektronický zdroj Kapitola
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=665073

Podobné jednotky

Podobné jednotky