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.
|Title of host publication||Proceedings of the IJCAI Workshop about Advances on Preference Handling|
|Publication status||Published - 2005|
|Event||IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling - Edinburgh, United Kingdom|
Duration: 31 Jul 2005 → 01 Aug 2005
http://preferencehandling.free.fr/MPref05/welcome.html (Link to event details online)
|Workshop||IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling|
|Period||31/07/2005 → 01/08/2005|