We propose a new data-driven method to select the optimal number of relevant components in Principal Component Analysis (PCA). This new method applies to correlation matrices whose time autocorrelation function decays more slowly than an exponential, giving rise to long memory effects. In comparison with other available methods present in the literature, our procedure does not rely on subjective evaluations and is computationally inexpensive. The underlying basic idea is to use a suitable factor model to analyse the residual memory after sequentially removing more and more components, and stopping the process when the maximum amount of memory has been accounted for by the retained components. We validate our methodology on both synthetic and real financial data, and find in all cases a clear and computationally superior answer entirely compatible with available heuristic criteria, such as cumulative variance and cross-validation.

This paper presents micro-econometric evidence for collaborative knowledge creation at the level of individual researchers. The key determinant for developing new ideas is the exchange of differentiated knowledge among collaborators. To stay creative, inventors seek opportunities to shift their technological expertise to unexplored niches by utilizing the differentiated knowledge of new collaborators. Furthermore, a more active recombination of collaborators by an inventor facilitates the selection of collaborators to raise the amount of differentiated knowledge from their collaborators.

The rough Bergomi (rBergomi) model, introduced recently in [4], is a promising rough volatility model in quantitative finance. It is a parsimonious model depending on only three parameters, and yet exhibits remarkable fit to 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 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 design a novel, alternative, hierarchical approach, based on i) adaptive sparse grids quadrature (ASGQ), and ii) quasi Monte Carlo (QMC). Both techniques are coupled with Brownian bridge construction and Richardson extrapolation. 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.

Although it is well known that wage inequality has evolved over recent decades, it is not known the extent to which the evolution of wage inequality is attributed to observed factors such as capital and labor quantities or unobserved factors such as labor-augmenting technology in many countries. To examine this issue, we use cross-country panel data from 14 OECD countries for the years 1970 to 2005 and estimate the aggregate production function extended to allow for capital-skill complementarity and skill-biased technological change. Our results point to a strong influence of the observed expansion of ICT capital equipment relative to high-skilled labor around the world.

This paper is part of the research on the interlinkages between insurers and their contribution to systemic risk on the insurance market. Its main purpose is to present the results of the analysis of linkage dynamics and systemic risk in the European insurance sector which are obtained using correlation networks. These networks are based on dynamic dependence structures modelled using a copula. Then, we determine minimum spanning trees (MST). Finally, the linkage dynamics is described by means of selected topological network measures.

We consider a game-theoretic model of a market where investors compete for payoffs yielded by several assets. The main result consists in a proof of existence and uniqueness of a strategy, called relatively growth optimal, such that the logarithm of the share of its wealth in the total wealth of the market is a submartingale for any strategies of the other investors. It is also shown that this strategy is asymptotically optimal in the sense that it achieves the maximal capital growth rate when compared to competing strategies. Based on the obtained results, we study the asymptotic structure of the market when all the investors use the relatively growth optimal strategy.

Midterm stock price prediction is crucial for value investments in the stock market. However, most deep learning models are essentially short-term and applying them to midterm predictions encounters large cumulative errors because they cannot avoid anomalies. In this paper, we propose a novel deep neural network Mid-LSTM for midterm stock prediction, which incorporates the market trend as hidden states. First, based on the autoregressive moving average model (ARMA), a midterm ARMA is formulated by taking into consideration both hidden states and the capital asset pricing model. Then, a midterm LSTM-based deep neural network is designed, which consists of three components: LSTM, hidden Markov model and linear regression networks. The proposed Mid-LSTM can avoid anomalies to reduce large prediction errors, and has good explanatory effects on the factors affecting stock prices. Extensive experiments on S&P 500 stocks show that (i) the proposed Mid-LSTM achieves 2-4% improvement in prediction accuracy, and (ii) in portfolio allocation investment, we achieve up to 120.16% annual return and 2.99 average Sharpe ratio.

Nowadays many financial derivatives which are traded on stock and futures exchanges, such as American or Bermudan options, are of early exercise type. Often the pricing of early exercise options gives rise to high-dimensional optimal stopping problems, since the dimension corresponds to the number of underlyings in the associated hedging portfolio. High-dimensional optimal stopping problems are, however, notoriously difficult to solve due to the well-known curse of dimensionality. In this work we propose an algorithm for solving such problems, which is based on deep learning and computes, in the context of early exercise option pricing, both approximations for an optimal exercise strategy and the price of the considered option. The proposed algorithm can also be applied to optimal stopping problems that arise in other areas where the underlying stochastic process can be efficiently simulated. We present numerical results for a large number of example problems, which include the pricing of many high-dimensional American and Bermudan options such as, for example, Bermudan max-call options in up to 5000~dimensions. Most of the obtained results are compared to reference values computed by exploiting the specific problem design or, where available, to reference values from the literature. These numerical results suggest that the proposed algorithm is highly effective in the case of many underlyings, in terms of both accuracy and speed.

In their seminal work on systemic risk in financial markets, Eisenberg and Noe proposed and studied a model with $n$ firms embedded into a network of debt relations. We analyze this model from a game-theoretic point of view. Every firm is a rational agent in a directed graph that has an incentive to allocate payments in order to clear as much of its debt as possible. Each edge is weighted and describes a liability between the firms. We consider several variants of the game that differ in the permissible payment strategies. We study the existence and computational complexity of pure Nash and strong equilibria, and we provide bounds on the (strong) prices of anarchy and stability for a natural notion of social welfare. Our results highlight the power of financial regulation -- if payments of insolvent firms can be centrally assigned, a socially optimal strong equilibrium can be found in polynomial time. In contrast, worst-case strong equilibria can be a factor of $\Omega(n)$ away from optimal, and, in general, computing a best response is an NP-hard problem. For less permissible sets of strategies, we show that pure equilibria might not exist, and deciding their existence as well as computing them if they exist constitute NP-hard problems.

A theory usually comprises assumptions and deduced predictions from them. In this paper, empirical evidences corroborate with assumptions about time for a decision making facing known probabilities and outcomes.

Quantification of risk positions under model uncertainty is of crucial importance from both viewpoints of external regulation and internal management. The concept of model uncertainty, sometimes also referred to as model ambiguity. Although we know the family of models, we cannot precisely decide which one to use. Given the set $\mathcal{P}$, the value of the risk measure $\rho$ varies in a range over the set of all possible models. The largest value in such a range is referred to as a worst-case value, and the corresponding model is called a worst scenario. Value-at-Risk(VaR) has become a very popular risk-measurement tool since it was first proposed. Naturally, WVaR(worst-case Value-at-Risk) attracts the attention of many researchers. Although many literatures investigated WVaR, the implications for empirical data analysis remain rare. In this paper, we proposed a special model uncertainty market model to simply the $\mathcal{P}$ to a set contain finite number of probability distributions. The model has the structure of the two-layer mixed distribution model. We used change point detection method to divide the returns series and then used EM algorithm to estimate the parameters. Finally, we calculated VaR, WVaR(worst-case Value-at-Risk) and BVaR(best-case Value-at-Risk) for four financial markets and then analyzed their different performance.