In Possibilistic Decision Theory (PDT), decisions are ranked by a pressimistic or by an optimistic qualitative criteria. The preference relations induced by these criteria have been axiomatized by corresponding sets of rationality postulates, both à la von Neumann and Morgenstern and à la Savage. In this paper we first address a particular issue regarding the axiomatic systems of PDT à la von Neumann and Morgenstern. Namely, we show how to adapt the axiomatic systems for the pessimistic and optimistic criteria when some finiteness assumptions in the original model are dropped. Second, we show that a recent axiomatic approach by Giang and Shenoy using binary utilities can be captured by preference relations defined as lexicographic refinements of the above two criteria. We also provide an axiomatic characterization of these lexicographic refinements.
@article{urn:eudml:doc:41879,
title = {Lexicographic combinations of preference relations in the context of Possibilistic Decision Theory.},
journal = {Mathware and Soft Computing},
volume = {13},
year = {2006},
pages = {157-171},
zbl = {1122.68111},
mrnumber = {MR2321600},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:41879}
}
Godo, Lluís; Zapico, Adriana. Lexicographic combinations of preference relations in the context of Possibilistic Decision Theory.. Mathware and Soft Computing, Tome 13 (2006) pp. 157-171. http://gdmltest.u-ga.fr/item/urn:eudml:doc:41879/