Optimal moment bounds under multiple shape constraints
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.
|Date of creation:||Jun 2009|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2009005. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.