The complete mixability and convex minimization problems with monotone marginal densities
Following the results of Rüschendorf and Uckelmann (2002)Â [20], we introduce the completely mixable distributions on and prove that the distributions with monotone density and moderate mean are completely mixable. Using this method, we solve the minimization problem for convex functions f and marginal distributions P with monotone density. Our results also provide valuable implications in variance minimization, bounds for the sum of random variables and risk theory.
Year of publication: |
2011
|
---|---|
Authors: | Wang, Bin ; Wang, Ruodu |
Published in: |
Journal of Multivariate Analysis. - Elsevier, ISSN 0047-259X. - Vol. 102.2011, 10, p. 1344-1360
|
Publisher: |
Elsevier |
Keywords: | Complete mixability Variance minimization Multivariate dependence Monotone densities Optimal coupling |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Extreme negative dependence and risk aggregation
Wang, Bin, (2015)
-
Complete mixability and asymptotic equivalence of worst-possible VaR and ES estimates
Puccetti, Giovanni, (2013)
-
Diversification Limit of Quantiles Under Dependence Uncertainty
Bignozzi, Valeria, (2016)
- More ...