Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Preference ordering algorithms with imprecise expectations
KTH, School of Information and Communication Technology (ICT), Computer and Systems Sciences, DSV.
2006 (English)In: Lect. Notes Eng. Comput. Sci., 2006, 750-755 p.Conference paper, Published paper (Refereed)
Abstract [en]

In imprecise domains the preference order of the alternatives is not straightforward to establish, due to possible overlapping of expected values among the alternatives. Nevertheless, such rankings are useful in decision analysis applications, as obtaining a ranking of alternatives is a way to gain an overview of the situation. The rankings presented in this paper represent overviews of a preference order of the alternatives based on their respective expected utility. The ranking can be either ordinal, focusing only on the ordering, or cardinal, also taking the differences in expected utility into account. The first set of procedures discussed is a cardinal ranking, which provides the user with expected utility intervals of the evaluated alternatives. This yields a more extensive overview with more detailed information. The second set of procedures discussed ordinal rankings of the alternatives based on three different approaches; 1) contraction based ranking, 2) intersection based ranking, and 3) focal point based ranking with indifference level. Finally, we show that regardless of ranking method their respective maximal elements all conform to the maximal element of the ordinal ranking. Hence, if the intention is to find a maximal element, it is sufficient to use either pointwise cardinal ranking or ordinal ranking with zero as indifference level.

Place, publisher, year, edition, pages
2006. 750-755 p.
Series
Lecture Notes in Engineering and Computer Science, ISSN 2078-0958
Keyword [en]
Alternative ranking, Decision analysis, Imprecise information, Utility theory, Expected utility, Maximal elements, Preference order, Ranking methods, Ranking of alternatives, Computer science, Decision theory, Decision making
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-155111ISI: 000241357500140Scopus ID: 2-s2.0-84888212505ISBN: 9789889867133 (print)OAI: oai:DiVA.org:kth-155111DiVA: diva2:760168
Conference
International MultiConference of Engineers and Computer Scientists 2006, IMECS 2006, 20-22 June 2006, Kowloon, Hong Kong
Note

QC 20141103

Available from: 2014-11-03 Created: 2014-10-30 Last updated: 2016-12-08Bibliographically approved

Open Access in DiVA

No full text

Scopus

Search in DiVA

By author/editor
Danielson, Mats
By organisation
Computer and Systems Sciences, DSV
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 15 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf