Partially Ordered Preferences in Decision Trees: Computing Strategies with Imprecision in Probabilities

Daniel Kikuti, Fabio G. Cozman, Cassio P. de Campos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Downloads (Pure)

Abstract

Partially ordered preferences generally lead to choices that do not abide by standard expected utility guidelines; often such preferences are revealed by imprecision in probability values. We investigate five criteria for strategy selection in decision trees with imprecision in probabilities: “extensive” Γ-maximin and Γ-maximax, interval dominance, maximality and E-admissibility. We present algorithms that generate strategies for all these criteria; our main contribution is an algorithm for Eadmissibility that runs over admissible strategies rather than over sets of probability distributions.
Original languageEnglish
Title of host publicationProceedings of the IJCAI Workshop about Advances on Preference Handling
PublisherIJAI
Pages118-123
Publication statusPublished - 2005
EventIJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling - Edinburgh, United Kingdom
Duration: 31 Jul 200501 Aug 2005
http://preferencehandling.free.fr/MPref05/welcome.html (Link to event details online)

Workshop

WorkshopIJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling
CountryUnited Kingdom
CityEdinburgh
Period31/07/200501/08/2005
Internet address

Fingerprint Dive into the research topics of 'Partially Ordered Preferences in Decision Trees: Computing Strategies with Imprecision in Probabilities'. Together they form a unique fingerprint.

Cite this