Using neural networks, we compute bounds on the prices of multi-asset derivatives given information on prices of related payoffs. As a main example, we focus on European basket options and include information on the prices of other similar options, such as spread options and/or basket options on subindices. We show that, in most cases, adding further constraints gives rise to bounds that are considerably tighter and discuss the maximizing/minimizing copulas achieving such bounds. Our approach follows the literature on constrained optimal transport and, in particular, builds on a recent paper by Eckstein and Kupper (2019, Appl. Math. Optim.).

The only input to attain the portfolio weights of global minimum variance portfolio (GMVP) is the covariance matrix of returns of assets being considered for investment. Since the population covariance matrix is not known, investors use historical data to estimate it. Even though sample covariance matrix is an unbiased estimator of the population covariance matrix, it includes a great amount of estimation error especially when the number of observed data is not much bigger than number of assets. As it is difficult to estimate the covariance matrix with high dimensionality all at once, clustering stocks is proposed to come up with covariance matrix in two steps: firstly, within a cluster and secondly, between clusters. It decreases the estimation error by reducing the number of features in the data matrix. The motivation of this dissertation is that the estimation error can still remain high even after clustering, if a large amount of stocks is clustered together in a single group. This research proposes to utilize a bounded clustering method in order to limit the maximum cluster size. The result of experiments shows that not only the gap between in-sample volatility and out-of-sample volatility decreases, but also the out-of-sample volatility gets reduced. It implies that we need a bounded clustering algorithm so that maximum clustering size can be precisely controlled to find the best portfolio performance.

The rough Bergomi (rBergomi) model, introduced recently in [5], is a promising rough volatility model in quantitative finance. It is a parsimonious model depending on only three parameters, and yet remarkably fits with empirical implied volatility surfaces. In the absence of analytical European option pricing methods for the model, and due to the non-Markovian nature of the fractional driver, the prevalent option is to use the Monte Carlo (MC) simulation for pricing. Despite recent advances in the MC method in this context, pricing under the rBergomi model is still a time-consuming task. To overcome this issue, we have designed a novel, hierarchical approach, based on i) adaptive sparse grids quadrature (ASGQ), and ii) quasi-Monte Carlo (QMC). Both techniques are coupled with a Brownian bridge construction and a Richardson extrapolation on the weak error. By uncovering the available regularity, our hierarchical methods demonstrate substantial computational gains with respect to the standard MC method, when reaching a sufficiently small relative error tolerance in the price estimates across different parameter constellations, even for very small values of the Hurst parameter. Our work opens a new research direction in this field, i.e., to investigate the performance of methods other than Monte Carlo for pricing and calibrating under the rBergomi model.

We show how spectral filters can improve the convergence of numerical schemes which use discrete Hilbert transforms based on a sinc function expansion, and thus ultimately on the fast Fourier transform. This is relevant, for example, for the computation of fluctuation identities, which give the distribution of the maximum or the minimum of a random path, or the joint distribution at maturity with the extrema staying below or above barriers. We use as examples the methods by Feng and Linetsky (2008) and Fusai, Germano and Marazzina (2016) to price discretely monitored barrier options where the underlying asset price is modelled by an exponential L\'evy process. Both methods show exponential convergence with respect to the number of grid points in most cases, but are limited to polynomial convergence under certain conditions. We relate these rates of convergence to the Gibbs phenomenon for Fourier transforms and achieve improved results with spectral filtering.

Firms with different ownership structures could be argued to have different levels of efficiency.Highly concentrated firms are expected to be more efficient as this type of ownership structure may alleviate the conflict of interest between managers and shareholders.In Malaysia, public-listed firms have been found to have highly concentrated ownership structure.However, whether this evidence holds for every industry has not been established.Hence, the objective of this paper is to investigate whether there are variations in ownership structure and firm's efficiency across sectors.To achieve this objective, the frequency distributions of ownership structure were calculated and firms efficiency scores for consumer products, industrial products, construction and trading/services sectors were measured.Data Envelopment Analysis(DEA) under the assumptions of constant returns to scale(CRS) and variable returns to scale(VRS) was employed to estimate firms efficiency scores.A sample of 156 firms listed on the Kuala Lumpur Stock Exchange(KLSE) was selected using the stratified random sampling method. The findings have shown that there are variations in firm ownership structure and efficiency across sectors.

This paper extends quadratic hedging from European to Bermudan options in discrete time when markets are incomplete and investigates its use for supporting exercise policy optimization. The key idea is to construct date specific approximate replicating portfolios. Hedging any given exercise policy can be done by solving a collection of stochastic dynamic programs. Optimizing the exercise policy based on the resulting martingale measure requires care. If this measure is risk neutral (RN), the value of an optimal such policy, which can be obtained by augmenting the hedging model with an exercise policy optimization step, is a no arbitrage one. Otherwise this approach must be refined by imposing time consistency on exercise policies, although the value of the resulting exercise policy may not be arbitrage free. Following the common pragmatic strategy of specifying quadratic hedging under an RN measure, e.g., one calibrated to market prices, avoids these issues. In particular, it provides a simple hedging policy with immediate practical applicability and is equivalent to exercise policy optimization under RN valuation, thus complementing it with a consistent hedging policy. A simple numerical example shows that this procedure generates effective hedging policies.

In this paper we study arbitrage theory of financial markets in the absence of a num\'eraire both in discrete and continuous time. In our main results, we provide a generalization of the classical equivalence between no unbounded profits with bounded risk (NUPBR) and the existence of a supermartingale deflator. To obtain the desired results, we introduce a new approach based on disintegration of the underlying probability space into spaces where the market crashes at deterministic times.

Choosing a portfolio of risky assets over time that maximizes the expected return at the same time as it minimizes portfolio risk is a classical problem in Mathematical Finance and is referred to as the dynamic Markowitz problem (when the risk is measured by variance) or more generally, the dynamic mean-risk problem. In most of the literature, the mean-risk problem is scalarized and it is well known that this scalarized problem does not satisfy the (scalar) Bellman's principle. Thus, the classical dynamic programming methods are not applicable. For the purpose of this paper we focus on the discrete time setup, and we will use a time consistent dynamic convex risk measure to evaluate the risk of a portfolio.

We will show that when we do not scalarize the problem, but leave it in its original form as a vector optimization problem, the upper images, whose boundary contains the efficient frontier, recurse backwards in time under very mild assumptions. Thus, the dynamic mean-risk problem does satisfy a Bellman's principle, but a more general one, that seems more appropriate for a vector optimization problem: a set-valued Bellman's principle.

We will present conditions under which this recursion can be exploited directly to compute a solution in the spirit of dynamic programming. Numerical examples illustrate the proposed method. The obtained results open the door for a new branch in mathematics: dynamic multivariate programming.