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|
|Publisher||International Joint Conference on Artificial Intelligence (IJCAI)|
|Number of pages||6|
|Publication status||Published - 2005|
|Event||IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling - Edinburgh, United Kingdom|
Duration: 31 Jul 2005 → 1 Aug 2005
|Workshop||IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling|
|Period||31/07/05 → 1/08/05|
Kikuti, D., Cozman, F. G., & de Campos, C. P. (2005). Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities. In Proceedings of the IJCAI Workshop about Advances on Preference Handling (pp. 118-123). International Joint Conference on Artificial Intelligence (IJCAI).