Mathematical Finance最新文献

In financial engineering, prices of financial products are computed approximately many times each trading day with (slightly) different parameters in each calculation. In many financial models such prices can be approximated by means of Monte Carlo (MC) simulations. To obtain a good approximation the MC sample size usually needs to be considerably large resulting in a long computing time to obtain a single approximation. A natural deep learning approach to reduce the computation time when new prices need to be calculated as quickly as possible would be to train an artificial neural network (ANN) to learn the function which maps parameters of the model and of the financial product to the price of the financial product. However, empirically it turns out that this approach leads to approximations with unacceptably high errors, in particular when the error is measured in the $�L^{\infty }$-norm, and it seems that ANNs are not capable to closely approximate prices of financial products in dependence on the model and product parameters in real life applications. This is not entirely surprising given the high-dimensional nature of the problem and the fact that it has recently been proved for a large class of algorithms, including the deep learning approach outlined above, that such methods are in general not capable to overcome the curse of dimensionality for such approximation problems in the $�L^{\infty }$-norm. In this article we introduce a new numerical approximation strategy for parametric approximation problems including the parametric financial pricing problems described above and we illustrate by means of several numerical experiments that the introduced approximation strategy achieves a very high accuracy for a variety of high-dimensional parametric approximation problems, even in the $�L^{\infty }$-norm. A central aspect of the approximation strategy proposed in this article is to combine MC algorithms with machine learning techniques to, roughly speaking, learn the random variables (LRV) in MC simulations. In other words, we employ stochastic gradient descent (SGD) optimization methods not to train parameters of standard ANNs but instead to learn random variables appearing in MC approximations. In that sense, the proposed LRV strategy has strong links to Quasi-Monte Carlo

The robustness of risk measures to changes in underlying loss distributions (distributional uncertainty) is of crucial importance in making well-informed decisions. In this paper, we quantify, for the class of distortion risk measures with an absolutely continuous distortion function, its robustness to distributional uncertainty by deriving its largest (smallest) value when the underlying loss distribution has a known mean and variance and, furthermore, lies within a ball—specified through the Wasserstein distance—around a reference distribution. We employ the technique of isotonic projections to provide for these distortion risk measures a complete characterization of sharp bounds on their value, and we obtain quasi-explicit bounds in the case of Value-at-Risk and Range-Value-at-Risk. We extend our results to account for uncertainty in the first two moments and provide applications to portfolio optimization and to model risk assessment.

Most insurance contracts are inherently linked to financial markets, be it via interest rates, or—as hybrid products like equity-linked life insurance and variable annuities—directly to stocks or indices. However, insurance contracts are not for trade except sometimes as surrender to the selling office. This excludes the situation of arbitrage by buying and selling insurance contracts at different prices. Furthermore, the insurer uses private information on top of the publicly available one about financial markets. This paper provides a study of the consistency of insurance contracts in connection with trades in the financial market with explicit mention of the information involved.

By defining strategies on an insurance portfolio and combining them with financial trading strategies, we arrive at the notion of insurance–finance arbitrage (IFA). In analogy to the classical fundamental theorem of asset pricing, we give a fundamental theorem on the absence of IFA, leading to the existence of an insurance–finance-consistent probability. In addition, we study when this probability gives the expected discounted cash-flows required by the EIOPA best estimate.

The generality of our approach allows to incorporate many important aspects, like mortality risk or general levels of dependence between mortality and stock markets. Utilizing the theory of enlargements of filtrations, we construct a tractable framework for insurance–finance consistent valuation.

We employ deep learning in forecasting high-frequency returns at multiple horizons for 115 stocks traded on Nasdaq using order book information at the most granular level. While raw order book states can be used as input to the forecasting models, we achieve state-of-the-art predictive accuracy by training simpler “off-the-shelf” artificial neural networks on stationary inputs derived from the order book. Specifically, models trained on order flow significantly outperform most models trained directly on order books. Using cross-sectional regressions, we link the forecasting performance of a long short-term memory network to stock characteristics at the market microstructure level, suggesting that “information-rich” stocks can be predicted more accurately. Finally, we demonstrate that the effective horizon of stock specific forecasts is approximately two average price changes.

We study the mean–variance hedging of an American-type contingent claim that is exercised at a random time in a Markovian setting. This problem is motivated by applications in the areas of employee stock option valuation, credit risk, or equity-linked life insurance policies with an underlying risky asset value guarantee. Our analysis is based on dynamic programming and uses PDE techniques. In particular, we prove that the complete solution to the problem can be expressed in terms of the solution to a system of one quasi-linear parabolic PDE and two linear parabolic PDEs. Using a suitable iterative scheme involving linear parabolic PDEs and Schauder's interior estimates for parabolic PDEs, we show that each of these PDEs has a classical C^{1, 2} solution. Using these results, we express the claim's mean–variance hedging value that we derive as its expected discounted payoff with respect to an equivalent martingale measure that does not coincide with the minimal martingale measure, which, in the context that we consider, identifies with the minimum entropy martingale measure as well as the variance-optimal martingale measure. Furthermore, we present a numerical study that illustrates aspects of our theoretical results.

Over 90% of exchange trading on crypto options has always been on the Deribit platform. This centralized crypto exchange only lists inverse products because they do not accept fiat currency. Likewise, other major crypto options platforms only list crypto–stablecoin trading pairs in so-called direct options, which are similar to the standard crypto options listed by the CME except the US dollar is replaced by a stablecoin version. Until now a clear mathematical exposition of these products has been lacking. We discuss the sources of market incompleteness in direct and inverse options and compare their pricing and hedging characteristics. Then we discuss the useful applications of currency protected “quanto” direct and inverse options for fiat-based traders and describe their pricing and hedging characteristics, all in the Black–Scholes setting.

We study a multiplayer stochastic differential game, where agents interact through their joint price impact on an asset that they trade to exploit a common trading signal. In this context, we prove that a closed-loop Nash equilibrium exists if the price impact parameter is small enough. Compared to the corresponding open-loop Nash equilibrium, both the agents' optimal trading rates and their performance move towards the central-planner solution, in that excessive trading due to lack of coordination is reduced. However, the size of this effect is modest for plausible parameter values.

We study discrete-time predictable forward processes when trading times do not coincide with performance evaluation times in a binomial tree model for the financial market. The key step in the construction of these processes is to solve a linear functional equation of higher order associated with the inverse problem driving the evolution of the predictable forward process. We provide sufficient conditions for the existence and uniqueness and an explicit construction of the predictable forward process under these conditions. Furthermore, we find that these processes are inherently myopic in the sense that optimal strategies do not make use of future model parameters even if these are known. Finally, we argue that predictable forward preferences are a viable framework to model human-machine interactions occurring in automated trading or robo-advising. For both applications, we determine an optimal interaction schedule of a human agent interacting infrequently with a machine that is in charge of trading.

We develop a convex-optimization clustering algorithm for heterogeneous financial networks, in the presence of arbitrary or even adversarial outliers. In the stochastic block model with heterogeneity parameters, we penalize nodes whose degree exhibit unusual behavior beyond inlier heterogeneity. We prove that under mild conditions, this method achieves exact recovery of the underlying clusters. In absence of any assumption on outliers, they are shown not to hinder the clustering of the inliers. We test the performance of the algorithm on semi-synthetic heterogenous networks reconstructed to match aggregate data on the Korean financial sector. Our method allows for recovery of sub-sectors with significantly lower error rates compared to existing algorithms. For overlapping portfolio networks, we uncover a clustering structure supporting diversification effects in investment management.

In this paper we consider a discrete-time risk sensitive portfolio optimization over a long time horizon with proportional transaction costs. We show that within the log-return i.i.d. framework the solution to a suitable Bellman equation exists under minimal assumptions and can be used to characterize the optimal strategies for both risk-averse and risk-seeking cases. Moreover, using numerical examples, we show how a Bellman equation analysis can be used to construct or refine optimal trading strategies in the presence of transaction costs.