Back to Search
Start Over
Partially Ordered Preferences in Decision Trees: Computing Strategies with Imprecision in Probabilities
- Source :
- 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 . IJAI, pp. 118-123, IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, Edinburgh, United Kingdom, 31/07/2005 .
- Publication Year :
- 2005
- Publisher :
- IJAI, 2005.
-
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.
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- 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 . IJAI, pp. 118-123, IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, Edinburgh, United Kingdom, 31/07/2005 .
- Accession number :
- edsair.od......2607..f55583002cbf5102722612b40f99ee1e