An explicit martingale representation for random variables described as a functional of a Levy process will be given. The Clark-Ocone theorem shows that integrands appeared in a martingale representation are given by conditional expectations of Malliavin derivatives. Our goal is to extend it to random variables which are not Malliavin differentiable. To this end, we make use of Ito's formula, instead of Malliavin calculus. As an application to mathematical finance, we shall give an explicit representation of locally risk-minimizing strategy of digital options for exponential Levy models. Since the payoff of digital options is described by an indicator function, we also discuss the Malliavin differentiability of indicator functions with respect to Levy processes.

The asymptotic distribution of the Markowitz portfolio is derived, for the general case (assuming fourth moments of returns exist), and for the case of multivariate normal returns. The derivation allows for inference which is robust to heteroskedasticity and autocorrelation of moments up to order four. As a side effect, one can estimate the proportion of error in the Markowitz portfolio due to mis-estimation of the covariance matrix. A likelihood ratio test is given which generalizes Dempster's Covariance Selection test to allow inference on linear combinations of the precision matrix and the Markowitz portfolio. Extensions of the main method to deal with hedged portfolios, conditional heteroskedasticity, conditional expectation, and constrained estimation are given. It is shown that the Hotelling-Lawley statistic generalizes the (squared) Sharpe ratio under the conditional expectation model. Asymptotic distributions of all four of the common `MGLH' statistics are found, assuming random covariates. Examples are given demonstrating the possible uses of these results.

In this paper, we study a semi-martingale optimal transport problem and its application to the calibration of Local-Stochastic Volatility (LSV) models. Rather than considering the classical constraints on marginal distributions at initial and final time, we optimise our cost function given the prices of a finite number of European options. We formulate the problem as a convex optimisation problem, for which we provide a dual formulation. We then solve numerically the dual problem, which involves a fully nonlinear Hamilton--Jacobi--Bellman equation. The method is tested by calibrating a Heston-like LSV model with simulated data.

In this paper we derive a generic decomposition of the option pricing formula for models with finite activity jumps in the underlying asset price process (SVJ models). This is an extension of the well-known result by Alos (2012) for Heston (1993) SV model. Moreover, explicit approximation formulas for option prices are introduced for a popular class of SVJ models - models utilizing a variance process postulated by Heston (1993). In particular, we inspect in detail the approximation formula for the Bates (1996) model with log-normal jump sizes and we provide a numerical comparison with the industry standard - Fourier transform pricing methodology. For this model, we also reformulate the approximation formula in terms of implied volatilities. The main advantages of the introduced pricing approximations are twofold. Firstly, we are able to significantly improve computation efficiency (while preserving reasonable approximation errors) and secondly, the formula can provide an intuition on the volatility smile behaviour under a specific SVJ model.

The research presented in this article provides an alternative option pricing approach for a class of rough fractional stochastic volatility models. These models are increasingly popular between academics and practitioners due to their surprising consistency with financial markets. However, they bring several challenges alongside. Most noticeably, even simple non-linear financial derivatives as vanilla European options are typically priced by means of Monte-Carlo (MC) simulations which are more computationally demanding than similar MC schemes for standard stochastic volatility models.

In this paper, we provide a proof of the prediction law for general Gaussian Volterra processes. The prediction law is then utilized to obtain an adapted projection of the future squared volatility -- a cornerstone of the proposed pricing approximation. Firstly, a decomposition formula for European option prices under general Volterra volatility models is introduced. Then we focus on particular models with rough fractional volatility and we derive an explicit semi-closed approximation formula. Numerical properties of the approximation for a popular model -- the rBergomi model -- are studied and we propose a hybrid calibration scheme which combines the approximation formula alongside MC simulations. This scheme can significantly speed up the calibration to financial markets as illustrated on a set of AAPL options.

We analyze what can be learned from tests for p-hacking based on distributions of t-statistics and p-values across multiple studies. We analytically characterize restrictions on these distributions that conform with the absence of p-hacking. This forms a testable null hypothesis and suggests statistical tests for p-hacking. We extend our results to p-hacking when there is also publication bias, and also consider what types of distributions arise under the alternative hypothesis that researchers engage in p-hacking. We show that the power of statistical tests for detecting p-hacking is low even if p-hacking is quite prevalent.

We study population behavior when choice is hard because considering alternatives is costly. To simplify their choice problem, individuals may pay attention to only a subset of available alternatives. We design and implement a novel online experiment that exogenously varies choice sets and consideration costs for a large sample of individuals. We provide a theoretical and statistical framework that allows us to test random consideration at the population level. Within this framework, we compare competing models of random consideration. We find that the standard random utility model fails to explain the population behavior. However, our results suggest that a model of random consideration with logit attention and heterogeneous preferences provides a good explanation for the population behavior. Finally, we find that the random consideration rule that subjects use is different for different consideration costs while preferences are not. We observe that the higher the consideration cost the further behavior is from the full-consideration benchmark, which supports the hypothesis that hard choices have a substantial negative impact on welfare via limited consideration.

Information transfer between time series is calculated by using the asymmetric information-theoretic measure known as transfer entropy. Geweke's autoregressive formulation of Granger causality is used to find linear transfer entropy, and Schreiber's general, non-parametric, information-theoretic formulation is used to detect non-linear transfer entropy.

We first validate these measures against synthetic data. Then we apply these measures to detect causality between social sentiment and cryptocurrency prices. We perform significance tests by comparing the information transfer against a null hypothesis, determined via shuffled time series, and calculate the Z-score. We also investigate different approaches for partitioning in nonparametric density estimation which can improve the significance of results.

Using these techniques on sentiment and price data over a 48-month period to August 2018, for four major cryptocurrencies, namely bitcoin (BTC), ripple (XRP), litecoin (LTC) and ethereum (ETH), we detect significant information transfer, on hourly timescales, in directions of both sentiment to price and of price to sentiment. We report the scale of non-linear causality to be an order of magnitude greater than linear causality.

We study long-run selection and treatment effects of a health insurance subsidy in Ghana, where mandates are not enforceable. We randomly provide different levels of subsidy (1/3, 2/3, and full), with follow-up surveys seven months and three years after the initial intervention. We find that a one-time subsidy promotes and sustains insurance enrollment for all treatment groups, but long-run health care service utilization increases only for the partial subsidy groups. We find evidence that selection explains this pattern: those who were enrolled due to the subsidy, especially the partial subsidy, are more ill and have greater health care utilization.

In this paper long-run risk sensitive optimisation problem is studied with dyadic impulse control applied to continuous-time Feller-Markov process. In contrast to the existing literature, focus is put on unbounded and non-uniformly ergodic case by adapting the weight norm approach. In particular, it is shown how to combine geometric drift with local minorisation property in order to extend local span-contraction approach when the process as well as the linked reward/cost functions are unbounded. For any predefined risk-aversion parameter, the existence of solution to suitable Bellman equation is shown and linked to the underlying stochastic control problem. For completeness, examples of uncontrolled processes that satisfy the geometric drift assumption are provided.

The pricing of financial derivatives, which requires massive calculations and close-to-real-time operations under many trading and arbitrage scenarios, were largely infeasible in the past. However, with the advancement of modern computing, the efficiency has substantially improved. In this work, we propose and design a multi-path option pricing approach via autoregression (AR) process and Monte Carlo Simulations (MCS). Our approach learns and incorporates the price characteristics into AR process, and re-generates the price paths for options. We apply our approach to price weekly options underlying Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) and compare the results with prior practiced models, e.g., Black-Scholes-Merton and Binomial Tree. The results show that our approach is comparable with prior practiced models.

In this paper, we introduce and develop the theory of semimartingale optimal transport in a path dependent setting. Instead of the classical constraints on marginal distributions, we consider a general framework of path dependent constraints. Duality results are established, representing the solution in terms of path dependent partial differential equations (PPDEs). Moreover, we provide a localisation result, which reduces the dimensionality of the solution by identifying appropriate state variables based on the constraints and the cost function. Our technique is then applied to the exact calibration of volatility models to the prices of general path dependent derivatives.

Stochastic gradient descent in continuous time (SGDCT) provides a computationally efficient method for the statistical learning of continuous-time models, which are widely used in science, engineering, and finance. The SGDCT algorithm follows a (noisy) descent direction along a continuous stream of data. The parameter updates occur in continuous time and satisfy a stochastic differential equation. This paper analyzes the asymptotic convergence rate of the SGDCT algorithm by proving a central limit theorem (CLT) for strongly convex objective functions and, under slightly stronger conditions, for non-convex objective functions as well. An $L^{p}$ convergence rate is also proven for the algorithm in the strongly convex case. The mathematical analysis lies at the intersection of stochastic analysis and statistical learning.

We propose two variants of the Smith-Wilson method for practical application in the insurance industry. Our first variant relaxes the Smith-Wilson energy and can be used to incorporate less reliable market data with a certain weight rather than disregarding it completely. This is particularly useful for deriving yield curves in the IFRS 17 accounting regime, where there is a mandate to incorporate all available market data.

A second variant incorporates the requirement to reach the ultimate forward rate at a prescribed term into the problem formulation. This provides a natural way to fulfil the Solvency II convergence requirement and is more elegant than the current methodology adapting the term-scale parameter to control convergence.