Over the past decades, researchers in economics, financial mathematics and actuarial science have introduced results to the concept of comonotonicity in their respective fields of interest. Comonotonicity is a very strong dependence structure and is very often mistaken as a dependence structure that is too extreme and unrealistic. However, the concept of comonotonicity is actually a useful tool for solving several research and practical problems in capital allocation, risk sharing and optimal allocation.
The first topic of this thesis is focused on the application of comonotonicity in optimal capital allocation. The Enterprise Risk Management process of a financial institution usually contains a procedure to allocate the total risk capital of the company into its different business units. Dhaene et al. (2012) proposed a unifying capital allocation framework by considering some general deviation measures. This general framework is extended to a more general optimization problem of minimizing separable convex function with a linear constraint and box constraints. A new approach of solving this constrained minimization problem explicitly by the concept of comonotonicity is developed. Instead of the traditional Kuhn-Tucker theory, a method of expressing each convex function as the expected stop-loss of some suitable random variable is used to solve the optimization problem. Then, some results in convex analysis with infimum-convolution are derived using the result of this new approach.
Next, Borch's theorem is revisited from the perspective of comonotonicity. The optimal solution to the Pareto optimal risk-sharing problem can be obtained by the Lagrangian method or variational arguments. Here, I propose a new method, which is based on a Breeden-Litzanbeger type integral representation formula for increasing convex functions. It enables the transform of the objective function into a sum of mixtures of stop-losses. Necessary conditions for the existence of optimal solution are then discussed. The explicit solution obtained allows us to show that the risk-sharing problem is indeed a “point-wise” problem, and hence the value function can be obtained immediately using the notion of supremum-convolution in convex analysis.
In addition to the above classical risk-sharing and capital allocation problems, the problem of minimizing a separable convex objective subject to an ordering restriction is then studied. Best et al. (2000) proposed a pool adjacent violators algorithm to compute the optimal solution. Instead, we show that using the concept of comonotonicity and the technique of dynamic programming the solution can be derived in a recursive manner. By identifying the right-hand derivative of the convex functions with distribution functions of some suitable random variables, we rewrite the objective function into a sum of expected deviations. This transformation and the fact that the expected deviation is a convex function enable us to solve the minimizing problem. / published_or_final_version / Statistics and Actuarial Science / Doctoral / Doctor of Philosophy
| Identifer | oai:union.ndltd.org:HKU/oai:hub.hku.hk:10722/207205 |
| Date | January 2014 |
| Creators | Rong, Yian, 戎軼安 |
| Contributors | Cheung, KC |
| Publisher | The University of Hong Kong (Pokfulam, Hong Kong) |
| Source Sets | Hong Kong University Theses |
| Language | English |
| Detected Language | English |
| Type | PG_Thesis |
| Rights | Creative Commons: Attribution 3.0 Hong Kong License, The author retains all proprietary rights, (such as patent rights) and the right to use in future works. |
| Relation | HKU Theses Online (HKUTO) |
Page generated in 0.002 seconds