In imprecise domains the preference order of the alternatives is not straightforward to establish, due to possible overlapping of expected values among the ...

In imprecise domains the preference order of the alternatives is not straightforward to establish, due to possible overlapping of expected values among the ...

In imprecise domains the preference order of the alternatives is not straightforward to establish, due to possible overlapping of expected values among the ...

https://dblp.org/rec/conf/imecs/IdefeldtLD06. Jim Idefeldt, Aron Larsson, Mats Danielson: Preference Ordering Algorithms with Imprecise Expectations. IMECS ...

TL;DR: In imprecise domains the preference order of the alternatives is not straightforward to establish, due to possible overlapping of expected values among ...

This criterion is based on a partial preference ordering induced by an imprecise probability model of the dynamics of the system, updated by observations of ...

This leads to an incomplete preference ordering. Lemma 3.1 highlights the challenge of learning with imprecision, imply- ing that unless the learners are ...

A partial preference ordering ( ) is a partial ordering of the gambles in L. `X Y ' is read as `gamble X is preferred to gamble Y'. A partial preference.

Idefeldt, J. , Larsson, A. & Danielsson, M. (2006). Preference Ordering Algorithms with Imprecise Expectations. I Proceedings of IMECS 2006.. S. 750--755.

Abstract. Partially ordered preferences generally lead to choices that do not abide by standard expected util- ity guidelines; often such preferences are ...