Optimizing permutation methods for the ordinal ranking problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F12%3A%230002140" target="_blank" >RIV/47813059:19520/12:#0002140 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Optimizing permutation methods for the ordinal ranking problem
Original language description
In many real-world decision-making situations and preferential votings objects or alternatives are ranked by experts from the best to the worst with the goal to achieve a group consensus. This setting is called ordinal (consensus) ranking problem (OCRP).Many methods were proposed for the solution of OCRP with an important class of the so called permutation methods such as the consensus ranking model (CRM) or hybrid distance-based ideal-seeking consensus ranking model (DCM), which seek the consensus inthe space of all permutations of the order n. The main limitation of these methods is that the number of permutations of order n grows as n!, making solving this problem virtually impossible for n larger than 10. The aim of the article is to propose a new technique which can reduce the number of permutations the methods' need to process, lowering their computational complexity and enabling them to deal with permutations of higher orders.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
AH - Economics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA402%2F09%2F0405" target="_blank" >GA402/09/0405: Development of Non-standard Optimization Methods and their Applications in Economy and Management</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 30th international conference Mathematical methods in economics 2012
ISBN
978-80-7248-779-0
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
160-165
Publisher name
Slezská univerzita v Opavě, Obchodně podnikatelská fakulta v Karviné
Place of publication
Karviná
Event location
Karviná
Event date
Jan 1, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—