All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

The ordinal consensus ranking problem with uncertain rankings

Result description

In the ordinal consensus ranking problem (OCRP) a set of k decision makers rank a set of n alternatives with regard to one overall criterion (or a set of criteria) from the 1st place to the nth place. The goal is to find a consensus ranking expressing anopinion of a group. The aim of this article is to present a model for OCRP solution with uncertain rankings. This approach is more suitable than classic approach with certain rankings, as the latter case doesn't allow for imprecise information or uncertainty often involved in real decision-making processes. In this paper uncertain ranking gij is defined as a decision maker's confidence that an alternative i is ranked at the jth position. In the model for OCRP solution with uncertain rankings generalized means operator is used for ranking aggregation and the final consensus ranking is obtained by the use of a binary dominance relation. The model can be extended to multiple criteria or different weights of decisi.

Keywords

group decision makingordinal consensus ranking problempreference rankinguncertain ranking

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    The ordinal consensus ranking problem with uncertain rankings

  • Original language description

    In the ordinal consensus ranking problem (OCRP) a set of k decision makers rank a set of n alternatives with regard to one overall criterion (or a set of criteria) from the 1st place to the nth place. The goal is to find a consensus ranking expressing anopinion of a group. The aim of this article is to present a model for OCRP solution with uncertain rankings. This approach is more suitable than classic approach with certain rankings, as the latter case doesn't allow for imprecise information or uncertainty often involved in real decision-making processes. In this paper uncertain ranking gij is defined as a decision maker's confidence that an alternative i is ranked at the jth position. In the model for OCRP solution with uncertain rankings generalized means operator is used for ranking aggregation and the final consensus ranking is obtained by the use of a binary dominance relation. The model can be extended to multiple criteria or different weights of decisi.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    AH - Economics

  • OECD FORD branch

Result continuities

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

    552-557

  • 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