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,742 papers · 148 categories

Trend · papers per month

151303454605 · Jun 202019922001200920172026
48 results for Parisian stopping times

Method calculates Parisian stopping times and option prices using Markov chains.

problem Computing distribution and pricing of Parisian stopping times under Markov processes.
method Continuous-time Markov chain approximation to solve for distribution and convergence analysis.
result Sharp convergence rate and efficient method for diffusion and jump models.

This paper develops methods for pricing American Parisian options under general Markov models.

problem Pricing American Parisian options with various types and payoff functions.
method General approaches using CTMC approximation for time-inhomogeneous Markov models, including state augmentation and variational inequalities.
result Efficient algorithms for pricing American Parisian options confirmed with numerical experiments.

The paper analyzes insurance risk with Parisian ruin and capital injection.

problem Analyzing insurance risk with Parisian ruin and capital injection.
method Using fluctuation and excursion theory of spectrally negative Levy processes.
result Distributional identities and ruin probabilities are derived.

In this paper, we study the concept of Parisian ruin under the hybrid observation scheme model introduced by Li et al. \cite{binetal2016}. Under this model, the process is observed at Poisson arrival times whenever the business is financially healthy and it is continuously observed when it goes below 00. The Parisian …

2019-07-23abs ↗pdf ↗

In this paper, we price American-style Parisian down-and-in call options under the Black-Scholes framework. Usually, pricing an American-style option is much more difficult than pricing its European-style counterpart because of the appearance of the optimal exercise boundary in the former. Fortunately, the optimal exer…

2015-11-05abs ↗pdf ↗

In this paper, we investigate Parisian ruin for a Lévy surplus process with an adaptive premium rate, namely a refracted Lévy process. More general Parisian boundary-crossing problems with a deterministic implementation delay are also considered. Our main contribution is a generalization of the result in Loeffen et al.…

2016-03-30abs ↗pdf ↗

In this note we give, for a spectrally negative Levy process, a compact formula for the Parisian ruin probability, which is defined by the probability that the process exhibits an excursion below zero, with a length that exceeds a certain fixed period r. The formula involves only the scale function of the spectrally ne…

2011-02-20abs ↗pdf ↗

In this paper, we obtain analytical expression for the distribution of the occupation time in the red (below level 00) up to an (independent) exponential horizon for spectrally negative Lévy risk processes and refracted spectrally negative Lévy risk processes. This result improves the existing literature in which only…

2019-03-09abs ↗pdf ↗

Solves optimal stopping problem with Poisson constraints using jumps.

problem Optimal stopping with Poisson constraints and jumps.
method Penalized backward stochastic differential equation (PBSDE) with jumps, decomposition method based on Jacod-Pham, comparison theorem of BSDEs with jumps.
result Solves American option pricing in nonlinear markets with Poisson constraints.

This note re-addresses the Paris barrier options proposed by Yor and collaborators and their valuation using the Laplace transform approach. The notion of Paris barrier options, based on excursion theory and using the Brownian meander, is extended such that their valuation is now possible at any point during their life…

2002-02-28abs ↗pdf ↗

We consider the optimal double stopping time problem defined for each stopping time SS by $v(S)=\esssup\{E[ψ(τ_1, τ_2) | \F_S], τ_1, τ_2 \geq S \}$. Following the optimal one stopping time problem, we study the existence of optimal stopping times and give a method to compute them. The key point is the construction of …

2009-09-18abs ↗pdf ↗

Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.

problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild assumptions.

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 ↗

The paper tackles optimal stopping problems using reinforcement learning and singular control.

problem Continuous-time and state-space optimal stopping problems.
method Formulated as a singular control problem with randomized stopping times and penalized cumulative residual entropy.
result Identified unique optimal exploratory strategy through dynamic programming.

Paper solves a complex stopping problem using regularization and HJB equations.

problem Time-inconsistent mean-variance optimal stopping problem
method Vanishing regularization method to derive HJB equations and prove existence of solutions
result Formally recovers variational inequalities for original problem

Study optimal stopping times under regime-switching models with constraints.

problem Optimal stopping times for discounted payoffs on a regime-switching geometric Brownian motion.
method Solve variational inequality to find value functions and optimal thresholds.
result Existence and expressions of optimal stopping times under specific conditions.

In this paper, we introduce an insurance ruin model with adaptive premium rate, thereafter refered to as restructuring/refraction, in which classical ruin and bankruptcy are distinguished. In this model, the premium rate is increased as soon as the wealth process falls into the red zone and is brought back to its regul…

2013-06-19abs ↗pdf ↗

We show, under weaker assumptions than in the previous literature, that a perpetual optimal stopping game always has a value. We also show that there exists an optimal stopping time for the seller, but not necessarily for the buyer. Moreover, conditions are provided under which the existence of an optimal stopping time…

2006-10-10abs ↗pdf ↗

We study a parsimonious but non-trivial model of the latent limit order book where orders get placed with a fixed displacement from a center price process, i.e.\ some process in-between best bid and best ask, and get executed whenever this center price reaches their level. This mechanism corresponds to the fundamental …

2017-01-04abs ↗pdf ↗

We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to the other player's action. In the first part of the paper, we consider the game wh…

2015-08-25abs ↗pdf ↗

This paper extends results of Mortimer and Williams (1991) about changes of probability measure up to a random time under the assumptions that all martingales are continuous and that the random time avoids stopping times. We consider locally absolutely continuous measure changes up to a random time, changes of probabil…

2013-09-24abs ↗pdf ↗

Existence of strong randomized equilibria in mean-field games with common noise.

problem Existence of strong solutions in mean-field games of optimal stopping.
method Connection with Bank-El Karoui's representation problem and continuity assumptions.
result Existence of strong randomized mean-field equilibrium under certain conditions.

Early stopping improves sample quality in latent diffusion models.

problem Latent diffusion models degrade sample quality with conventional early stopping.
method Analyzed the interaction between latent dimension and stopping time under Gaussian framework.
result Lower-dimensional representations benefit from earlier termination, higher-dimensional spaces require later stopping.

In the standard models for optimal multiple stopping problems it is assumed that between two exercises there is always a time period of deterministic length δδ, the so called refraction period. This prevents the optimal exercise times from bunching up together on top of the optimal stopping time for the one-exercise c…

2012-05-09abs ↗pdf ↗

A framework for robust exploration in reinforcement learning under ambiguity.

problem Optimal stopping under ambiguity in reinforcement learning.
method Continuous-time robust reinforcement learning framework using gg-expectation and backward stochastic differential equations.
result Constructs a robust exploratory stopping time approximating the optimal stopping time under ambiguity.

New algorithms use Gaussian processes to optimize stopping times in financial markets.

problem Optimizing stopping times in financial time series with specific applications.
method Gaussian and Deep Gaussian Process models to analytically evaluate optimal stopping value functions and policies.
result Proposed algorithms outperform benchmarks on various financial time series datasets.

Probabilistic proof of smooth boundaries in optimal stopping problems.

problem Continuous differentiability of time-dependent optimal boundaries in optimal stopping problems.
method Local probabilistic arguments for a wider range of conditions.
result First probabilistic proof of continuous differentiability under general conditions.

Inspired by recent work of P.-L. Lions on conditional optimal control, we introduce a problem of optimal stopping under bounded rationality: the objective is the expected payoff at the time of stopping, conditioned on another event. For instance, an agent may care only about states where she is still alive at the time …

2019-01-17abs ↗pdf ↗

This work bounds the run-time of nonconvex optimization with early stopping.

problem Bounding the expected run-time of nonconvex optimization with early stopping.
method Derives conditions for well-defined early stopping based on validation function norms and bounds the expected number of iterations and gradient evaluations.
result Guarantees the validity of early stopping and provides bounds on the expected run-time for various optimization algorithms.

Given an initial (resp., terminal) probability measure μμ (resp., νν) on Rd\mathbb{R}^d, we characterize those optimal stopping times ττ that maximize or minimize the functional EB0Bτα\mathbb{E} |B_0 - B_τ|^α, α>0α> 0, where (Bt)t(B_t)_t is Brownian motion with initial law B0μB_0\sim μ and with final distribution --once stop…

2017-11-08abs ↗pdf ↗

Improved algorithm for optimal stopping problems reduces runtime.

problem Optimal stopping problems with infinite time horizon and random discounting.
method Flexible forward improvement iteration with a variable look-ahead distance.
result The new algorithm converges and can significantly reduce runtime.

Study optimal stopping times for multi-dimensional processes with non-exponential discounting.

problem Optimal stopping in multi-dimensional processes with non-exponential discounting.
method Probabilistic potential theory to establish existence of optimal equilibria.
result Existence of optimal equilibria for multi-dimensional stopping problems.