Consider the problem of computing the optimal lower and upper bound for the expected value E[_(X)], where X is an uncertain random probability variable. This paper studies the case in which the density of X is restricted by multiple shape constraints, each imposed on a different subset of the domain. We derive (closed) convex hull representations that allow us to reduce the optimization problem to a class of generating measures that are composed of convex sums of local probability measures. Furthermore, the notion of mass constraints is introduced to spread out the probability mass over the entire domain. A generalization to mass uncertainty is discussed as well.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number
2009005.