Remittances mean an important connection between people working abroad and their home countries. This paper considers these transfers as a measure of preferences revealed by the workers, underlying a ranking of countries around the world. We use the World Bank bilateral remittances data of international salaries and interpersonal transfers between 2010 and 2015 to compare European countries. The suggested least squares method implies that the ranking is invariant to country sizes and satisfies the axiom of bridge country independence. Our ranking reveals a crucial aspect of quality of life and may become an alternative to various composite indices.

Uniswap---and other constant product markets---appear to work well in practice despite their simplicity. In this paper, we give a simple formal analysis of constant product markets and their generalizations, showing that, under some common conditions, these markets must closely track the reference market price. We also show that Uniswap satisfies many other desirable properties and numerically demonstrate, via a large-scale agent-based simulation, that Uniswap is stable under a wide range of market conditions.

We provide an exact analytical solution of the Nash equilibrium for the $k$th price auction by using inverse of distribution functions. As applications, we identify the unique symmetric equilibrium where the valuations have polynomial distribution, fat tail distribution and exponential distributions.

The use of sequential Monte Carlo within simulation for path-dependent option pricing is proposed and evaluated. Recently, it was shown that explicit solutions and importance sampling are valuable for efficient simulation of spot price and volatility, especially for purposes of path-dependent option pricing. The resulting simulation algorithm is an analog to the weighted particle filtering algorithm that might be improved by resampling or branching. Indeed, some branching algorithms are shown herein to improve pricing performance substantially while some resampling algorithms are shown to be less suitable in certain cases. A historical property is given and explained as the distinguishing feature between the sequential Monte Carlo algorithms that work on path-dependent option pricing and those that do not. In particular, it is recommended to use the so-called effective particle branching algorithm within importance-sampling Monte Carlo methods for path-dependent option pricing. All recommendations are based upon numeric comparison of option pricing problems in the Heston model.

This paper compares alternative univariate versus multivariate models, frequentist versus Bayesian autoregressive and vector autoregressive specifications, for hourly day-ahead electricity prices, both with and without renewable energy sources. The accuracy of point and density forecasts are inspected in four main European markets (Germany, Denmark, Italy and Spain) characterized by different levels of renewable energy power generation. Our results show that the Bayesian VAR specifications with exogenous variables dominate other multivariate and univariate specifications, in terms of both point and density forecasting.

Rank size plots of very different systems are usually fitted with Zipf's law, however, one often observes strong deviations at large sizes. We show that these deviations contain essential and general information on the evolution and the intrinsic cutoffs of the system. In particular, if the first ranks show deviations from Zipf's law, the empirical maximum represents the intrinsic upper cutoff of the physical system. Moreover, pure Zipf's law is always present whenever the underlying power-law size distribution is undersampled.

Many researchers both in academia and industry have long been interested in the stock market. Numerous approaches were developed to accurately predict future trends in stock prices. Recently, there has been a growing interest in utilizing graph-structured data in computer science research communities. Methods that use relational data for stock market prediction have been recently proposed, but they are still in their infancy. First, the quality of collected information from different types of relations can vary considerably. No existing work has focused on the effect of using different types of relations on stock market prediction or finding an effective way to selectively aggregate information on different relation types. Furthermore, existing works have focused on only individual stock prediction which is similar to the node classification task. To address this, we propose a hierarchical attention network for stock prediction (HATS) which uses relational data for stock market prediction. Our HATS method selectively aggregates information on different relation types and adds the information to the representations of each company. Specifically, node representations are initialized with features extracted from a feature extraction module. HATS is used as a relational modeling module with initialized node representations. Then, node representations with the added information are fed into a task-specific layer. Our method is used for predicting not only individual stock prices but also market index movements, which is similar to the graph classification task. The experimental results show that performance can change depending on the relational data used. HATS which can automatically select information outperformed all the existing methods.

Partial (replication) index tracking is a popular passive investment strategy. It aims to replicate the performance of a given index by constructing a tracking portfolio which contains some constituents of the index. The tracking error optimisation is quadratic and NP-hard when taking the $\ell_0$ constraint into account so it is usually solved by heuristic methods such as evolutionary algorithms. This paper introduces a simple, efficient and scalable connectionist model as an alternative. We propose a novel reparametrisation method and then solve the optimisation problem with stochastic neural networks. The proposed approach is examined with S\&P 500 index data for more than 10 years and compared with widely used index tracking approaches such as forward and backward selection and the largest market capitalisation methods. The empirical results show our model achieves excellent performance. Compared with the benchmarked models, our model has the lowest tracking error, across a range of portfolio sizes. Meanwhile it offers comparable performance to the others on secondary criteria such as volatility, Sharpe ratio and maximum drawdown.

LSTMs promise much to financial time-series analysis, temporal and cross-sectional inference, but we find they do not deliver in a real-world financial management task. We examine an alternative called Continual Learning (CL), a memory-augmented approach, which can provide transparent explanations; which memory did what and when. This work has implications for many financial applications including to credit, time-varying fairness in decision making and more. We make three important new observations. Firstly, as well as being more explainable, time-series CL approaches outperform LSTM and a simple sliding window learner (feed-forward neural net (FFNN)). Secondly, we show that CL based on a sliding window learner (FFNN) is more effective than CL based on a sequential learner (LSTM). Thirdly, we examine how real-world, time-series noise impacts several similarity approaches used in CL memory addressing. We provide these insights using an approach called Continual Learning Augmentation (CLA) tested on a complex real world problem; emerging market equities investment decision making. CLA provides a test-bed as it can be based on different types of time-series learner, allowing testing of LSTM and sliding window (FFNN) learners side by side. CLA is also used to test several distance approaches used in a memory recall-gate: euclidean distance (ED), dynamic time warping (DTW), auto-encoder (AE) and a novel hybrid approach, warp-AE. We find CLA out-performs simple LSTM and FFNN learners and CLA based on a sliding window (CLA-FFNN) out-performs a LSTM (CLA-LSTM) implementation. While for memory-addressing, ED under-performs DTW and AE but warp-AE shows the best overall performance in a real-world financial task.

We develop a modelling framework for multiple yield curves driven by continuous-state branching processes with immigration (CBI processes). Exploiting the self-exciting behavior of CBI jump processes, this approach can reproduce the relevant empirical features of spreads between different interbank rates. We provide a complete analytical framework, including a detailed study of discounted exponential moments of CBI processes. The proposed framework yields explicit valuation formulae for all linear interest rate derivatives as well as semi-closed formulae for nonlinear derivatives via Fourier techniques and quantization. We show that a simple specification of the model can be successfully calibrated to market data.

We investigate the links between various no-arbitrage conditions and the existence of pricing functionals in general markets, and prove the Fundamental Theorem of Asset Pricing therein. No-arbitrage conditions, either in this abstract setting or in the case of a market consisting of European Call options, give rise to duality properties of infinite-dimensional sub- and super-hedging problems. With a view towards applications, we show how duality is preserved when reducing these problems over finite-dimensional bases. We finally perform a rigorous perturbation analysis of those linear programming problems, and highlight numerically the influence of smile extrapolation on the bounds of exotic options.

In this paper, we present a method for the accurate estimation of the derivative (aka.~sensitivity) of expectations of functions involving an indicator function by combining a stochastic algorithmic differentiation and a regression.

The method is an improvement of the approach presented in [Risk Magazine April 2018].

The finite difference approximation of a partial derivative of a Monte-Carlo integral of a discontinuous function is known to exhibit a high Monte-Carlo error. The issue is evident since the Monte-Carlo approximation of a discontinuous function is just a finite sum of discontinuous functions and as such, not even differentiable.

The algorithmic differentiation of a discontinuous function is problematic. A natural approach is to replace the discontinuity by continuous functions. This is equivalent to replacing a path-wise automatic differentiation by a (local) finite difference approximation.

We present an improvement (in terms of variance reduction) by decoupling the integration of the Dirac delta and the remaining conditional expectation and estimating the two parts by separate regressions. For the algorithmic differentiation, we derive an operator that can be injected seamlessly - with minimal code changes - into the algorithm resulting in the exact result.

The field of study of this paper is the analysis of the exchange between two subjects. Circumscribed to the micro dimension, it is however expanded with respect to standard economic theory by introducing both the dimension of power and the motivation to exchange. The basic reference is made by the reflections of those economists, preeminently John Kenneth Galbraith, who criticize the removal from the neoclassical economy of the "power" dimension. We have also referred to the criticism that Galbraith, among others, makes to the assumption of neoclassical economists that the "motivation" in exchanges is solely linked to the reward, to the money obtained in the exchange. We have got around the problem of having a large number of types of power and also a large number of forms of motivation by directly taking into account the effects on the welfare of each subject, regardless of the means with which they are achieved: that is, referring to everything that happens in the negotiation process to the potential or real variations of the welfare function induced in each subject due to the exercise of the specific form of power, on a case by case basis, and of the intensity of the motivation to perform the exchange. In the construction of a mathematical model we paid great attention to its usability in field testing.

We discuss the idea of a purely algorithmic universal world iCurrency set forth in [Kakushadze and Liew, 2014] (https://ssrn.com/abstract=2542541) and expanded in [Kakushadze and Liew, 2017] (https://ssrn.com/abstract=3059330) in light of recent developments, including Libra. Is Libra a contender to become iCurrency? Among other things, we analyze the Libra proposal, including the stability and volatility aspects, and discuss various issues that must be addressed. For instance, one cannot expect a cryptocurrency such as Libra to trade in a narrow band without a robust monetary policy. The presentation in the main text of the paper is intentionally nontechnical. It is followed by an extensive appendix with a mathematical description of the dynamics of (crypto)currency exchange rates in target zones, mechanisms for keeping the exchange rate from breaching the band, the role of volatility, etc.