Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

15304459 · May 202619922001200920172026
48 results for Monotonic Payoffs

The paper analyzes Variable Annuities with surrender charges, providing a pricing formula and optimal exercise boundary.

problem Analyzing Variable Annuities with surrender charges and early termination rights.
method Formulated as an optimal stopping problem with a discontinuous payoff, non-monotonic optimal stopping boundaries are proven continuous and regular.
result A rigorous pricing formula and optimal exercise boundary for surrender options are derived.

In this paper, we investigate the generalization of the Call-Put duality equality obtained in [1] for perpetual American options when the Call-Put payoff (yx)+(y-x)^+ is replaced by φ(x,y)φ(x,y). It turns out that the duality still holds under monotonicity and concavity assumptions on φφ. The specific analytical form of the …

2006-12-21abs ↗pdf ↗

SISR improves feature attribution in complex payoff schemes.

problem Distorted feature attributions due to non-additive payoff functions and high-dimensional feature spaces.
method Sparse Isotonic Shapley Regression (SISR) learns a monotonic transformation to restore additivity and enforces L0 sparsity.
result SISR achieves strong support recovery and stable attributions across various payoff schemes.

This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to an optimal stopping time problem with state constraint, and then in a Markovian…

2015-03-31abs ↗pdf ↗

We use probabilistic methods to characterise time dependent optimal stopping boundaries in a problem of multiple optimal stopping on a finite time horizon. Motivated by financial applications we consider a payoff of immediate stopping of "put" type and the underlying dynamics follows a geometric Brownian motion. The op…

2014-07-25abs ↗pdf ↗

Paper solves bond option pricing with credit risk using Black-Scholes equations.

problem Pricing options on bonds with credit risk.
method Solution representations of Black-Scholes equations for specific problems.
result Pricing formulae for puttable and callable bonds with credit risk.

The paper explores arbitrage opportunities in derivative markets under specific conditions.

problem Arbitrage opportunities in derivative markets under different conditions.
method Analyzes the relationship between pricing kernel monotonicity and stochastic arbitrage opportunities.
result Pricing kernel nonmonotonicity is equivalent to stochastic arbitrage opportunities under adequacy.

Introduces SMMV preferences to avoid inconsistency in portfolio selection.

problem Monotone mean-variance preferences fail to differentiate strictly dominant payoffs.
method Introduces strictly monotone mean-variance preferences and applies them to portfolio selection problems.
result SMMV preferences provide a more rational basis for assessing prospects and coincide with MV preferences under certain conditions.

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 …

2018-09-25abs ↗pdf ↗

New algorithms reduce regret for online submodular maximization under various conditions.

problem Online optimization of submodular functions with adversarial or random utilities.
method Characterized strongly DR-submodular functions and derived bounds for different utility classes.
result Logarithmic regret bounds for adversarial strongly DR-submodular functions and submodular functions with random order.

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.

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…

2019-10-22abs ↗pdf ↗

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 …

2011-02-07abs ↗pdf ↗

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(d12T11+ε)O(d^{\frac{1}{2}}T^{\frac{1}{1+ε}}) for ε(0,1]ε\in(0,1].

Study of 2imes22 imes 2 zero-sum games with noisy observations and commitments.

problem Analyzing 2imes22 imes 2 zero-sum games with noisy observations and commitments.
method Modeling a 2imes22 imes 2 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…

2019-07-17abs ↗pdf ↗

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.

Paper reduces dimensionality for robust option pricing in 2-asset markets.

problem Robust option pricing in multi-asset markets with sub- or supermodular payoffs.
method Investigates the geometry of VMOT solutions, proving dimension reduction for 2 assets and developing a Sinkhorn algorithm.
result Dimension reduction to single-factor structure for 2-asset markets, significantly reducing computational time and improving accuracy.

Study dynamic risk measures with distributional uncertainty using optimal transport.

problem Risk robustification under distributional uncertainty in Markovian models.
method Characterize risk measures via convex monotone semigroups and optimal transport costs.
result Identify generator and correction terms for dynamic risk measures under different scaling regimes.

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…

2013-05-15abs ↗pdf ↗

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.

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.

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 ii, the learner receives information about the payoff of every action jj in the form of Gaussian observations whose mean is the same as the mean payoff, but the variance depends on the pair (i,j)(i,j) (and may…

2015-10-27abs ↗pdf ↗

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.