Standard game-theoretic formulations for settings like contextual pricing and security games assume that agents act in accordance with a specific behavioral model. In practice however, some agents may not prescribe to the dominant behavioral model or may act in ways that are arbitrarily inconsistent. Existing algorithms heavily depend on the model being (approximately) accurate for all agents and have poor performance in the presence of even a few such arbitrarily irrational agents. How do we design learning algorithms that are robust to the presence of arbitrarily irrational agents?

We address this question for a number of canonical game-theoretic applications by designing a robust algorithm for the fundamental problem of multidimensional binary search. The performance of our algorithm degrades gracefully with the number of corrupted rounds, which correspond to irrational agents and need not be known in advance. As binary search is the key primitive in algorithms for contextual pricing, Stackelberg Security Games, and other game-theoretic applications, we immediately obtain robust algorithms for these settings.

Our techniques draw inspiration from learning theory, game theory, high-dimensional geometry, and convex analysis, and may be of independent algorithmic interest.

A noteworthy feature of U.S. politics in recent years is serious partisan conflict, which has led to intensifying polarization and exacerbating high policy uncertainty. The US is a significant player in oil and gold markets. Oil and gold also form the basis of important strategic reserves in the US. We investigate whether U.S. partisan conflict affects the returns and price volatility of oil and gold using a parametric test of Granger causality in quantiles. The empirical results suggest that U.S. partisan conflict has an effect on the returns of oil and gold, and the effects are concentrated at the tail of the conditional distribution of returns. More specifically, the partisan conflict mainly affects oil returns when the crude oil market is in a bearish state (lower quantiles). By contrast, partisan conflict matters for gold returns only when the gold market is in a bullish scenario (higher quantiles). In addition, for the volatility of oil and gold, the predictability of partisan conflict index virtually covers the entire distribution of volatility.

Algorithmic trading is well studied in traditional financial markets. However, it has received less attention in centralized cryptocurrency exchanges. The Commodity Futures Trading Commission (CFTC) attributed the $2010$ flash crash, one of the most turbulent periods in the history of financial markets that saw the Dow Jones Industrial Average lose $9\%$ of its value within minutes, to automated order "spoofing" algorithms. In this paper, we build a set of methodologies to characterize and empirically measure different algorithmic trading strategies in Binance, a large centralized cryptocurrency exchange, using a complete data set of historical trades. We find that a sub-strategy of triangular arbitrage is widespread, where bots convert between two coins through an intermediary coin, and obtain a favorable exchange rate compared to the direct one. We measure the profitability of this strategy, characterize its risks, and outline two strategies that algorithmic trading bots use to mitigate their losses. We find that this strategy yields an exchange ratio that is $0.144\%$, or $14.4$ basis points (bps) better than the direct exchange ratio. $2.71\%$ of all trades on Binance are attributable to this strategy.

This paper presents a model order reduction (MOR) approach for high dimensional problems in the analysis of financial risk. To understand the financial risks and possible outcomes, we have to perform several thousand simulations of the underlying product. These simulations are expensive and create a need for efficient computational performance. Thus, to tackle this problem, we establish a MOR approach based on a proper orthogonal decomposition (POD) method. The study involves the computations of high dimensional parametric convection-diffusion reaction partial differential equations (PDEs). POD requires to solve the high dimensional model at some parameter values to generate a reduced-order basis. We propose an adaptive greedy sampling technique based on surrogate modeling for the selection of the sample parameter set that is analyzed, implemented, and tested on the industrial data. The results obtained for the numerical example of a floater with cap and floor under the Hull-White model indicate that the MOR approach works well for short-rate models.

Let $\mathcal{X}$ be a subset of $L^1$ that contains the space of simple random variables $\mathcal{L}$ and $\rho: \mathcal{X} \rightarrow (-\infty,\infty]$ a dilatation monotone functional with the Fatou property. In this note, we show that $\rho$ extends uniquely to a $\sigma(L^1,\mathcal{L})$ lower semicontinuous and dilatation monotone functional $\overline{\rho}: L^1 \rightarrow (-\infty,\infty]$. Moreover, $\overline{\rho}$ preserves monotonicity, (quasi)convexity, and cash-additivity of $\rho$. Our findings complement recent extension results for quasiconvex law-invariant functionals proved in [17,20]. As an application of our results, we show that transformed norm risk measures on Orlicz hearts admit a natural extension to $L^1$ that retains the robust representations obtained in [4,6].

In this paper we study both analytic and numerical solutions of option pricing equations using systems of orthogonal polynomials. Using a Galerkin-based method, we solve the parabolic partial diferential equation for the Black-Scholes model using Hermite polynomials and for the Heston model using Hermite and Laguerre polynomials. We compare obtained solutions to existing semi-closed pricing formulas. Special attention is paid to the solution of Heston model at the boundary with vanishing volatility.