اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدData driven partition-of-unity copulas with applications to risk management
159
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a constructive and self-contained approach to data driven general partition-of-unity copulas that were recently introduced in the literature. In particular, we consider Bernstein-, negative binomial and Poisson copulas and present a solution to the problem of fitting such copulas to highly asymmetric data.
قيم البحث
اقرأ أيضاً
We construct new multivariate copulas on the basis of a generalized infinite partition-of-unity approach. This approach allows - in contrast to finite partition-of-unity copulas - for tail-dependence as well as for asymmetry. A possibility of fitting
such copulas to real data from quantitative risk management is also pointed out.
We present a constructive and self-contained approach to data driven infinite partition-of-unity copulas that were recently introduced in the literature. In particular, we consider negative binomial and Poisson copulas and present a solution to the p
roblem of fitting such copulas to highly asymmetric data in arbitrary dimensions.
We present a constructive approach to Bernstein copulas with an admissible discrete skeleton in arbitrary dimensions when the underlying marginal grid sizes are smaller than the number of observations. This prevents an overfitting of the estimated de
pendence model and reduces the simulation effort for Bernstein copulas a lot. In a case study, we compare different approaches of Bernstein and Gaussian copulas w.r.t. the estimation of risk measures in risk management.
When applying Value at Risk (VaR) procedures to specific positions or portfolios, we often focus on developing procedures only for the specific assets in the portfolio. However, since this small portfolio risk analysis ignores information from assets
outside the target portfolio, there may be significant information loss. In this paper, we develop a dynamic process to incorporate the ignored information. We also study how to overcome the curse of dimensionality and discuss where and when benefits occur from a large number of assets, which is called the blessing of dimensionality. We find empirical support for the proposed method.
We propose some machine-learning-based algorithms to solve hedging problems in incomplete markets. Sources of incompleteness cover illiquidity, untradable risk factors, discrete hedging dates and transaction costs. The proposed algorithms resulting s
trategies are compared to classical stochastic control techniques on several payoffs using a variance criterion. One of the proposed algorithm is flexible enough to be used with several existing risk criteria. We furthermore propose a new moment-based risk criteria.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
