Closed pricing formulas for Variance Gamma model payoffs.
problem Pricing path-independent payoffs in the Variance Gamma model.
method Mellin transform theory and multidimensional complex analysis.
result Closed-form pricing formulas with accelerated convergence for short-term options.
Closed-form formulas for path-independent options in a specific Lévy model.
problem Valuation of path-independent options in the exponential NIG model.
method Closed-form pricing formulas derived using a factorized representation in Mellin space and complex analysis.
result Valid closed-form formulas with quickly convergent series for various options.
Path-independent equilibrium models improve network performance on harder problems.
problem Improving network performance on harder problem instances.
method Investigated path-independent equilibrium models and their impact on network performance.
result Path independence correlates with better performance on harder problem instances.
Typically options with a path dependent payoff, such as Target Accumulation Redemption Note (TARN), are evaluated by a Monte Carlo method. This paper describes a finite difference scheme for pricing a TARN option. Key steps in the proposed scheme involve tracking of multiple one-dimensional finite difference solutions,…
Geometric framework for CFMMs simplifies many results.
problem Understanding the behavior of CFMMs without strong conditions.
method Developed a geometric framework encompassing known results.
result CFMMs have a canonical trading function with specific properties.
Method constructs CFMMs matching desired payoffs.
problem Creating CFMMs with specific payoff functions.
method Uses convex analysis and Fenchel conjugacy.
result Every concave, nonnegative, nondecreasing, 1-homogeneous payoff has a corresponding convex CFMM.
Optimal payoff choice constrained by Bregman-Wasserstein divergence.
problem Maximizing utility under a deviation constraint from a benchmark.
method Solving the problem using Bregman-Wasserstein divergence with a convex function φ.
result Provided the optimal payoff choice in this setting.
Optimal portfolio yields a digital option payoff.
problem Portfolio optimization under generalized dual theory of choice.
method Characterized optimal solution and derived it in closed form.
result Payoff is a digital option that yields in-the-money payoff in good market scenarios.
Study finds cheapest possible payoff under ambiguity, linking to maxmin expected utility.
problem Finding cost-efficient payoffs in uncertain market conditions.
method Developed a new concept of robust cost-efficient payoff and linked it to maxmin expected utility.
result Solutions to maxmin robust expected utility are robust cost-efficient.
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.
problem Hidden dependence of asset pricing models on price and payoff autocorrelations.
method Obtained approximations of the basic pricing equation describing various parameters.
result Valid results for other pricing models like ICAPM and APM.
New method uses neural networks for better financial hedging.
problem Spanning multi-asset payoffs with vanilla options.
method One-hidden-layer feedforward neural networks for numerical solution.
result Better hedging results with neural networks compared to single-asset approaches.
Paper shows how to replicate payoffs without oracles in CFMMs.
problem Replicating payoffs without oracles in CFMMs.
method Using liquidity provider shares in CFMMs to match any monotonic payoff.
result Explicit method and formula for trading functions and earnings.
Geometric framework for inverse problems using foliations and dual connections.
problem Reconstruction problems in inverse problems.
method Vaisman foliations and Atiyah--Molino sequences to induce transverse foliations and dual connections.
result Unique, path-independent reconstruction with vanishing torsion and curvature duality.
Quantum computer method for pricing rainbow options efficiently.
problem Pricing rainbow options with quantum computers.
method Iterative Quantum Amplitude Estimation and amplitude loading techniques.
result Validation of quantum pricing model on IBM QASM simulator.
New algorithm adapts to unknown smoothness in contextual bandits.
problem Adapting to unknown smoothness in non-parametric multi-armed bandits.
method Develops a self-similarity condition-based policy to adapt to unknown smoothness.
result Matches known smoothness case's regret rate for differentiable and non-differentiable payoff functions.
Develops a new method for robust risk measurement by averaging nearby payoffs.
problem Measuring risk under uncertainty with a focus on robustness.
method Averaging nearby payoffs weighted by a chosen metric.
result The method leads to a convex risk measure and provides stability under large neighborhoods.
Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic classes, combinatorial transgressions have not been previously studied. First, …
Agent optimizes perpetual contract liquidation with transaction costs and risk.
problem Optimizing perpetual contract liquidation with transaction costs and risk.
method Solving stochastic control problem for optimal trading strategy.
result Closed-form expression and approximations for optimal strategy.
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.
problem Analyzing a game of war of attrition under complete information.
method Examined the stability of equilibria in pure and mixed strategies under varying payoffs.
result Pure strategy equilibria are more robust to perturbations of the canonical model.
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 …
New algorithms for stochastic linear bandits with heavy-tailed payoffs achieve nearly optimal regret.
problem Stochastic linear bandits with heavy-tailed payoffs.
method Median of means and dynamic truncation.
result Sublinear regret bound of O(d21T1+ε1) for ε∈(0,1]. 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…
Study of 2imes2 zero-sum games with noisy observations and commitments.
problem Analyzing 2imes2 zero-sum games with noisy observations and commitments. method Modeling a 2imes2 zero-sum game with a leader committing to a strategy and a follower observing a noisy version of the leader's action. result Observing the leader's action is either beneficial or immaterial for the follower, and the equilibrium payoff is bounded.
This paper studies robust payoff allocation in submodular games, especially against replication.
problem Payoff allocation in submodular games, especially robustness against replication.
method Systematically studied replication manipulation in submodular games, introduced replication robustness metric, and validated with empirical ML data market.
result Conditions characterizing robustness of semivalues in submodular games.
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…
Study on optimal information acquisition in Kyle model with entropy cost.
problem Optimal information acquisition in Kyle model with entropy cost.
method Continuous signals are optimal, and any signal with a logit posterior distribution yields the same ex-ante value.
result Posterior expected payoff becomes normally distributed as information acquisition cost increases.
We derive a formula for liquidity providers' payoff on DEXs, linking it to volatility.
problem Liquidity providers on DEXs are undercompensated for their service.
method We derive a payoff formula for liquidity providers on DEXs, assuming geometric Brownian price movements and zero arbitrage.
result The payoff from liquidity fees is a near-linear function of volatility.
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 paper examines bounds for stop-loss payoffs using transformed random variables.
problem Bounding stop-loss payoffs for a difference of two random variables.
method Analyzes crossing points of cdfs of original and transformed random variables.
result Unique pairwise crossing points for mortality-linked securities under symmetric copulas.
New decision-theoretic calibration error metric improves prediction reliability.
problem Improving the reliability of predictions for decision-making.
method Proposed Calibration Decision Loss (CDL) and an efficient algorithm to achieve near-optimal CDL.
result Near-optimal CDL guarantees vanishing payoff loss from miscalibration.
Quantum Monte Carlo speeds up option pricing for complex payoff functions.
problem Efficiently pricing options with complex payoff functions using quantum computing.
method Developed a quantum Monte Carlo algorithm for multidimensional Black-Scholes PDEs.
result Proved polynomial computational complexity and speed-up over classical methods.
Bielecki and Rutkowski (2014) introduced and studied a generic nonlinear market model, which includes several risky assets, multiple funding accounts and margin accounts. In this paper, we examine the pricing and hedging of contract both from the perspective of the hedger and the counterparty with arbitrary initial end…
New method uses DistRL to estimate entire payoff distribution for financial derivatives.
problem Traditional methods focus on expected option value; this tackles risk-aware pricing.
method Reinterprets and proposes a framework using Distributional Reinforcement Learning (DistRL).
result Demonstrates enhanced risk-aware pricing and uncertainty quantification on Asian options.
We consider a sequential learning problem with Gaussian payoffs and side information: after selecting an action i, the learner receives information about the payoff of every action j in the form of Gaussian observations whose mean is the same as the mean payoff, but the variance depends on the pair (i,j) (and may…
Novel approach to financial derivatives pricing using rough path theory.
problem No-arbitrage conditions in financial markets necessitating precise integration methods.
method Developed a polynomial-based approximation class for rough path functionals, extending to non-geometric rough paths.
result Motivated a hypothesis for payoff functionals in financial markets, facilitating analysis.
Bielecki and Rutkowski (2014) introduced and studied a generic nonlinear market model, which includes several risky assets, multiple funding accounts and margin accounts. In this paper, we examine the pricing and hedging of contract both from the perspective of the hedger and the counterparty with arbitrary initial end…
New algorithms improve on bandit feedback in matrix games with unknown payoff matrices.
problem Improving performance in matrix games with unknown payoff matrices and bandit feedback.
method Regret analyses of variants of UCB and K-learning.
result New algorithms achieve lower regret compared to adversarial bandit algorithms.
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 this paper, we extend the first-order asymptotics analysis of Fouque et al. to general path-dependent financial derivatives using Dupire's functional Ito calculus. The main conclusion is that the market group parameters calibrated to vanilla options can be used to price to the same order exotic, path-dependent deriv…
Paper defines saddle points in asymmetric Dynkin games using martingale theory.
problem Tackles saddle point conditions in asymmetric Dynkin games with partial information.
method Uses martingale theory to identify super and submartingales related to equilibrium payoffs.
result Characterizes saddle point strategies in terms of equilibrium payoffs' dynamics and Doob-Meyer decompositions.
In this work, we expand the idea of Samuelson[3] and Shepp[2,5,6] for stock optimization using the Bachelier model [4] as our models for the stock price at the money (X[stock price]= K[strike price]) for the American call and put options [1]. At the money (X= K) for American options, the expected payoff of both the cal…
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…
The paper bounds payoffs and option prices in discrete models.
problem Measuring risk in discrete models and incomplete markets.
method Analytical and simulated bounds for payoff functions and option prices.
result Analytical and simulated bounds for European and American options.
Game theory model shows optimal investment strategy for wealth growth.
problem Minimizing time to reach large wealth in a stochastic asset market.
method Proved strategy of proportional asset investment minimizes expected time.
result Proportional investment strategy asymptotically minimizes time to large wealth.
The paper extends ERP framework to non-monotonic payoffs and short selling bans.
problem Valuation of contingent claims with short selling bans under ERP framework.
method Unified framework for ERP pricing, extending to non-monotonic payoffs, and comparing with Black-Scholes.
result Equal-risk prices differ from Black-Scholes prices under short selling bans.
This paper studies the payoff amounts in simple interest loans without arbitrage.
problem Understanding the payoff amounts in simple interest loans without arbitrage.
method Developed a formula for the payoff amount for simple interest loans, studied within a model of a loan market.
result The sequence of payoff amounts is increasing before a certain critical time and then decreasing.