Mathematical Finance最新文献

Generative adversarial networks (GANs) have been extremely successful in generating samples, from seemingly high-dimensional probability measures. However, these methods struggle to capture the temporal dependence of joint probability distributions induced by time-series data. Furthermore, long time-series data streams hugely increase the dimension of the target space, which may render generative modeling infeasible. To overcome these challenges, motivated by the autoregressive models in econometric, we are interested in the conditional distribution of future time series given the past information. We propose the generic conditional Sig-WGAN framework by integrating Wasserstein-GANs (WGANs) with mathematically principled and efficient path feature extraction called the signature of a path. The signature of a path is a graded sequence of statistics that provides a universal description for a stream of data, and its expected value characterizes the law of the time-series model. In particular, we develop the conditional Sig-$�W_1$ metric that captures the conditional joint law of time series models and use it as a discriminator. The signature feature space enables the explicit representation of the proposed discriminators, which alleviates the need for expensive training. We validate our method on both synthetic and empirical dataset and observe that our method consistently and significantly outperforms state-of-the-art benchmarks with respect to measures of similarity and predictive ability.

In a complete market, we find optimal portfolios for an investor whose satisfaction stems from both a payoff's intrinsic utility and its comparison with an endogenous reference as modeled by Kőszegi and Rabin. In the regular regime, arising when reference dependence is low, the marginal utility of the optimal payoff is proportional to a twist of the pricing kernel. High reference dependence leads to the anchors regime, whereby investors reduce disappointment by concentrating significant probability in one or few fixed outcomes, or “anchors.” Multiple equilibria arise because anchors may not be unique. If stocks follow geometric Brownian motion, the model implies that investors with longer horizons choose larger stocks holdings.

Modern portfolio theory has provided for decades the main framework for optimizing portfolios. Because of its sensitivity to small changes in input parameters, especially expected returns, the mean–variance framework proposed by Markowitz in 1952 has, however, been challenged by new construction methods that are purely based on risk. Among risk-based methods, the most popular ones are Minimum Variance, Maximum Diversification, and Risk Budgeting (especially Equal Risk Contribution) portfolios. Despite some drawbacks, Risk Budgeting is particularly attracting because of its versatility: based on Euler's homogeneous function theorem, it can indeed be used with a wide range of risk measures. This paper presents mathematical results regarding the existence and the uniqueness of Risk Budgeting portfolios for a very wide spectrum of risk measures and shows that, for many of them, computing the weights of Risk Budgeting portfolios only requires a standard stochastic algorithm.

This paper studies the well-posedness of a class of nonlocal fully nonlinear parabolic systems, which nest the equilibrium Hamilton–Jacobi–Bellman (HJB) systems that characterize the time-consistent Nash equilibrium point of a stochastic differential game (SDG) with time-inconsistent (TIC) preferences. The nonlocality of the parabolic systems stems from the flow feature (controlled by an external temporal parameter) of the systems. This paper proves the existence and uniqueness results as well as the stability analysis for the solutions to such systems. We first obtain the results for the linear cases for an arbitrary time horizon and then extend them to the quasilinear and fully nonlinear cases under some suitable conditions. Two examples of TIC SDG are provided to illustrate financial applications with global solvability. Moreover, with the well-posedness results, we establish a general multidimensional Feynman–Kac formula in the presence of nonlocality (time inconsistency).

We study a game between liquidity provider (LP) and liquidity taker agents interacting in an over-the-counter market, for which the typical example is foreign exchange. We show how a suitable design of parameterized families of reward functions coupled with shared policy learning constitutes an efficient solution to this problem. By playing against each other, our deep-reinforcement-learning-driven agents learn emergent behaviors relative to a wide spectrum of objectives encompassing profit-and-loss, optimal execution, and market share. In particular, we find that LPs naturally learn to balance hedging and skewing, where skewing refers to setting their buy and sell prices asymmetrically as a function of their inventory. We further introduce a novel RL-based calibration algorithm, which we found performed well at imposing constraints on the game equilibrium. On the theoretical side, we are able to show convergence rates for our multi-agent policy gradient algorithm under a transitivity assumption, closely related to generalized ordinal potential games.

This paper studies an equity market of stochastic dimension, where the number of assets fluctuates over time. In such a market, we develop the fundamental theorem of asset pricing, which provides the equivalence of the following statements: (i) there exists a supermartingale numéraire portfolio; (ii) each dissected market, which is of a fixed dimension between dimensional jumps, has locally finite growth; (iii) there is no arbitrage of the first kind; (iv) there exists a local martingale deflator; (v) the market is viable. We also present the optional decomposition theorem, which characterizes a given nonnegative process as the wealth process of some investment-consumption strategy. Furthermore, similar results still hold in an open market embedded in the entire market of stochastic dimension, where investors can only invest in a fixed number of large capitalization stocks. These results are developed in an equity market model where the price process is given by a piecewise continuous semimartingale of stochastic dimension. Without the continuity assumption on the price process, we present similar results but without explicit characterization of the numéraire portfolio.

Expected shortfall (ES, also known as CVaR) is the most important coherent risk measure in finance, insurance, risk management, and engineering. Recently, Wang and Zitikis (2021) put forward four economic axioms for portfolio risk assessment and provide the first economic axiomatic foundation for the family of $�\mathrm{ES}$. In particular, the axiom of no reward for concentration (NRC) is arguably quite strong, which imposes an additive form of the risk measure on portfolios with a certain dependence structure. We move away from the axiom of NRC by introducing the notion of concentration aversion, which does not impose any specific form of the risk measure. It turns out that risk measures with concentration aversion are functions of ES and the expectation. Together with the other three standard axioms of monotonicity, translation invariance and lower semicontinuity, concentration aversion uniquely characterizes the family of ES. In addition, we establish an axiomatic foundation for the problem of mean-ES portfolio selection and new explicit formulas for convex and consistent risk measures. Finally, we provide an economic justification for concentration aversion via a few axioms on the attitude of a regulator towards dependence structures.

Overnight rates, such as the Secured Overnight Financing Rate (SOFR) in the United States, are central to the current reform of interest rate benchmarks. A striking feature of overnight rates is the presence of jumps and spikes occurring at predetermined dates due to monetary policy interventions and liquidity constraints. This corresponds to stochastic discontinuities (i.e., discontinuities occurring at ex ante known points in time) in their dynamics. In this work, we propose a term structure modeling framework based on overnight rates and characterize absence of arbitrage in a generalized Heath–Jarrow–Morton (HJM) setting. We extend the classical short-rate approach to accommodate stochastic discontinuities, developing a tractable setup driven by affine semimartingales. In this context, we show that simple specifications allow to capture stylized facts of the jump behavior of overnight rates. In a Gaussian setting, we provide explicit valuation formulas for bonds and caplets. Furthermore, we investigate hedging in the sense of local risk-minimization when the underlying term structures feature stochastic discontinuities.

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