The Non Dominated Set in Bayesian Decision Problems with Convex Loss Functions

Bayesian decision problems require subjective elicitation of the inputs: beliefs and preferences. Sometimes, elicitation methods may not represent perfectly the judgements of the decision maker. Several foundations propose to overlay this problem using robust approaches. In these models, beliefs are modelled by a class of probability distributions and preferences by a class of loss functions. Then, we are in the conditions of a Pareto order. Hence the solution concept is the set of non dominated alternatives. In this article we focus on the computation of the efficient set when the preferences are modeled by a class of convex loss functions.