arXiv research

New algorithms for stochastic linear bandits with heavy-tailed payoffs achieve nearly optimal regret.

Agent optimizes perpetual contract liquidation with transaction costs and risk.

New method uses neural networks for better financial hedging.

The paper tackles risk-averse multi-armed bandit with linear payoffs.

New algorithm for partially observable contexts in finance.

In the spirit of Arrow-Debreu, we introduce a family of financial derivatives that act as primitive securities in that exotic derivatives can be approximated by their linear combinations. We call these financial derivatives signature payoffs. We show that signature payoffs can be used to nonparametrically price and hed…

In an online contract selection problem there is a seller which offers a set of contracts to sequentially arriving buyers whose types are drawn from an unknown distribution. If there exists a profitable contract for the buyer in the offered set, i.e., a contract with payoff higher than the payoff of not accepting any c…

The portfolio optimization problem is a basic problem of financial analysis. In the study, an optimization model for constructing an options portfolio with a certain payoff function has been proposed. The model is formulated as an integer linear programming problem and includes an objective payoff function and a system…

We investigate a class of optimal stopping problems arising in, for example, studies considering the timing of an irreversible investment when the underlying follows a skew Brownian motion. Our results indicate that the local directional predictability modeled by the presence of a skew point for the underlying has a no…

The game-theoretic risk management framework put forth in the precursor work "Towards a Theory of Games with Payoffs that are Probability-Distributions" (arXiv:1506.07368 [q-fin.EC]) is herein extended by algorithmic details on how to compute equilibria in games where the payoffs are probability distributions. Our appr…

We derive a formula for liquidity providers' payoff on DEXs, linking it to volatility.

We study the problem of repeated play in a zero-sum game in which the payoff matrix may change, in a possibly adversarial fashion, on each round; we call these Online Matrix Games. Finding the Nash Equilibrium (NE) of a two player zero-sum game is core to many problems in statistics, optimization, and economics, and fo…

Adaptive populations such as those in financial markets and distributed control can be modeled by the Minority Game. We consider how their dynamics depends on the agents' initial preferences of strategies, when the agents use linear or quadratic payoff functions to evaluate their strategies. We find that the fluctuatio…

In this paper we propose a new robust algorithm to find the optimal static replicating portfolios for general nonlinear payoff functions and give the estimate of the rate of convergence that is absent in the literature. We choose the static replication by minimizing the error bound between the nonlinear payoff function…

Improved regret bounds for contextual combinatorial semi-bandits with linear payoffs.

Study nonconcave portfolio choice with smooth ambiguity and Bayesian learning.

Broadens Jourdain and Martini's method to non-linear stochastic processes.

In this paper we extend Buchen's method to develop a new technique for pricing of some exotic options with several expiry dates(more than 3 expiry dates) using a concept of higher order binary option. At first we introduce the concept of higher order binary option and then provide the pricing formulae of $n$-th order b…

We propose a general framework for the simultaneous modeling of equity, government bonds, corporate bonds and derivatives. Uncertainty is generated by a general affine Markov process. The setting allows for stochastic volatility, jumps, the possibility of default and correlation between different assets. We show how to…

We study the online saddle point problem, an online learning problem where at each iteration a pair of actions need to be chosen without knowledge of the current and future (convex-concave) payoff functions. The objective is to minimize the gap between the cumulative payoffs and the saddle point value of the aggregate …

Contextual bandits with linear payoffs, which are also known as linear bandits, provide a powerful alternative for solving practical problems of sequential decisions, e.g., online advertisements. In the era of big data, contextual data usually tend to be high-dimensional, which leads to new challenges for traditional l…

Method constructs CFMMs matching desired payoffs.

In linear stochastic bandits, it is commonly assumed that payoffs are with sub-Gaussian noises. In this paper, under a weaker assumption on noises, we study the problem of \underline{lin}ear stochastic {\underline b}andits with h{\underline e}avy-{\underline t}ailed payoffs (LinBET), where the distributions have finite…

Gradient methods converge exponentially in concave network games.

Optimal payoff choice constrained by Bregman-Wasserstein divergence.

The study finds no evidence of stochastic arbitrage opportunities in S&P 500 index options.

Optimal portfolio yields a digital option payoff.

Explicit robust hedging strategies for convex or concave payoffs under a continuous semimartingale model with uncertainty and small transaction costs are constructed. In an asymptotic sense, the upper and lower bounds of the cumulative volatility enable us to super-hedge convex and concave payoffs respectively. The ide…

Study finds cheapest possible payoff under ambiguity, linking to maxmin expected utility.

We introduce signature payoffs, a family of path-dependent derivatives that are given in terms of the signature of the price path of the underlying asset. We show that these derivatives are dense in the space of continuous payoffs, a result that is exploited to quickly price arbitrary continuous payoffs. This approach …

The paper uncovers the impact of price and payoff autocorrelations in multi-period asset pricing models.

ARC algorithm optimizes dynamic pricing with correlated observations.

Study path-dependent affine models under uncertain parameters for financial applications.

Paper shows how to replicate payoffs without oracles in CFMMs.

We study a non-parametric multi-armed bandit problem with stochastic covariates, where a key complexity driver is the smoothness of payoff functions with respect to covariates. Previous studies have focused on deriving minimax-optimal algorithms in cases where it is a priori known how smooth the payoff functions are. I…

We extend a linear version of the liquidity risk model of Cetin et al. (2004) to allow for price impacts. We show that the impact of a market order on prices depends on the size of the transaction and the level of liquidity. We obtain a simple characterization of self-financing trading strategies and a sufficient condi…

We study minority games in efficient regime. By incorporating the utility function and aggregating agents with similar strategies we develop an effective mesoscale notion of state of the game. Using this approach, the game can be represented as a Markov process with substantially reduced number of states with explicitl…

Dynamic hedging of an European option under a general local volatility model with small linear transaction costs is studied. A continuous control version of Leland's strategy that asymptotically replicates the payoff is constructed. An associated central limit theorem of hedging error is proved. The asymptotic error va…

Safe Gaussian Process Bandit Optimization with sub-linear regret bounds.

Employing probabilistic techniques we compute best possible upper and lower bounds on the price of an option on one or two assets with continuous piecewise linear payoff function based on prices of simple call options of possibly distinct maturities and the no-arbitrage condition, but without any assumption on the pric…

Develops a new method for robust risk measurement by averaging nearby payoffs.

Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant interest after several studies demonstrated it to have better empirical performance compared to the state-of-the-art methods. However, many ques…

SISR improves feature attribution in complex payoff schemes.

Multi-armed bandit problems are the most basic examples of sequential decision problems with an exploration-exploitation trade-off. This is the balance between staying with the option that gave highest payoffs in the past and exploring new options that might give higher payoffs in the future. Although the study of band…

New findings show pure strategy equilibria are more robust in a war of attrition game.

We study the use of the multilevel Monte Carlo technique in the context of the calculation of Greeks. The pathwise sensitivity analysis differentiates the path evolution and reduces the payoff's smoothness. This leads to new challenges: the inapplicability of pathwise sensitivities to non-Lipschitz payoffs often makes …

We first study an optimal stopping problem in which a player (an agent) uses a discrete stopping time in order to stop optimally a payoff process whose risk is evaluated by a (non-linear) $g$-expectation. We then consider a non-zero-sum game on discrete stopping times with two agents who aim at minimizing their respect…

Optimizes non-linear outcomes from summed contributions.