Optimizing permutation methods for the ordinal ranking problem

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimizing permutation methods for the ordinal ranking problem

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Optimizing permutation methods for the ordinal ranking problem

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

AH - Ekonomie

OECD FORD obor

—

Projekt

<a href="/cs/project/GA402%2F09%2F0405" target="_blank" >GA402/09/0405: Rozvoj nestandardních optimalizačních metod a jejich aplikace v ekonomii a managementu</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 30th international conference Mathematical methods in economics 2012

ISBN

978-80-7248-779-0

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

160-165

Název nakladatele

Slezská univerzita v Opavě, Obchodně podnikatelská fakulta v Karviné

Místo vydání

Karviná

Místo konání akce

Karviná

Datum konání akce

1. 1. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—