Non-Transitive Binary Relation of Preference in the Case of Random Value Functions, Derived from REPOMP
Natalia D. Nikolova, Snejana Ivanova, Gergana Georgieva, Kiril Tenekedjiev
Natalia D. Nikolova
Available Online October 2013.
- https://doi.org/10.2991/.2013.31How to use a DOI?
- indifference classes, nontransitivity, hypothesis testing, ranking
- This work analyses decision making situations, where the quantity of the value function associated with the alternatives is a random number with known distribution. The main contribution of the paper is that alternatives are grouped into pseudo indifference classes, where the alternatives are indifferent to at least one of the other alternatives in the class. However, not all elements in the set are indifferent to each other, unlike classical indifference classes. Since the resulting relation of strict preference over pseudo indifference classes turns out to be non-transitive, it is demonstrated both in theory and in terms of an example that it is strongly dependent on the significance level of comparisons in order to allocate alternatives into groups.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Natalia D. Nikolova AU - Snejana Ivanova AU - Gergana Georgieva AU - Kiril Tenekedjiev PY - 2013/10 DA - 2013/10 TI - Non-Transitive Binary Relation of Preference in the Case of Random Value Functions, Derived from REPOMP BT - Fourth International Workshop on Knowledge Discovery, Knowledge Management and Decision Support PB - Atlantis Press SP - 255 EP - 261 SN - 1951-6851 UR - https://doi.org/10.2991/.2013.31 DO - https://doi.org/10.2991/.2013.31 ID - Nikolova2013/10 ER -