Optimization of the ordinal and cardinal consistency of a preference matrix in decision making

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F15%3A50003619" target="_blank" >RIV/62690094:18450/15:50003619 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization of the ordinal and cardinal consistency of a preference matrix in decision making

Popis výsledku v původním jazyce

In multi-criteria decision problems the relative importance of alternatives is computed from preference matrices, which come from experience and can possibly be inconsistent. Two consistency types of preferences are studied in the paper. The ordinal consistency preserves the order in which the alternatives are arranged, and it does not allow cycles. The term 'cyclic consistency' is also used for this type. The second type is the cardinal consistency, when not only the order, but also the exact values ofthe relative importance must be consistent. In this paper efficient algorithms for computing consistent approximations of both types for a given preference matrix are described. The main result is an algorithm which combines the advantages of both particular types and computes the optimal consistent approximation of a given preference matrix in the ordinal and in the cardinal sense. The described algorithm can also be used for processing preference matrices with missing data. The perfor

Název v anglickém jazyce

Optimization of the ordinal and cardinal consistency of a preference matrix in decision making

Popis výsledku anglicky

In multi-criteria decision problems the relative importance of alternatives is computed from preference matrices, which come from experience and can possibly be inconsistent. Two consistency types of preferences are studied in the paper. The ordinal consistency preserves the order in which the alternatives are arranged, and it does not allow cycles. The term 'cyclic consistency' is also used for this type. The second type is the cardinal consistency, when not only the order, but also the exact values ofthe relative importance must be consistent. In this paper efficient algorithms for computing consistent approximations of both types for a given preference matrix are described. The main result is an algorithm which combines the advantages of both particular types and computes the optimal consistent approximation of a given preference matrix in the ordinal and in the cardinal sense. The described algorithm can also be used for processing preference matrices with missing data. The perfor

Druh

D - Stať ve sborníku

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

<a href="/cs/project/GA14-02424S" target="_blank" >GA14-02424S: Metody operačního výzkumu pro podporu rozhodování v podmínkách neurčitosti</a><br>

Návaznosti

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

Rok uplatnění

2015

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

IFSA-EUSFLAT 2015

ISBN

9789462520776

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

851-856

Název nakladatele

Atlantis press

Místo vydání

Paris

Místo konání akce

Gijon, SPAIN

Datum konání akce

30. 6. 2015

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

WRD - Celosvětová akce

Kód UT WoS článku

000358581100120