Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureHoofdstukAcademicpeer review

Samenvatting

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.
Originele taal-2Engels
TitelProceedings of the IJCAI Workshop about Advances on Preference Handling
UitgeverijInternational Joint Conference on Artificial Intelligence (IJCAI)
Pagina's118-123
Aantal pagina's6
StatusGepubliceerd - 2005
Extern gepubliceerdJa
EvenementIJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling - Edinburgh, Verenigd Koninkrijk
Duur: 31 jul 20051 aug 2005

Workshop

WorkshopIJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling
Land/RegioVerenigd Koninkrijk
StadEdinburgh
Periode31/07/051/08/05

Vingerafdruk

Duik in de onderzoeksthema's van 'Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities'. Samen vormen ze een unieke vingerafdruk.

Citeer dit