Method calculates Parisian stopping times and option prices using Markov chains.
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.
Trend · papers per month
This paper develops methods for pricing American Parisian options under general Markov models.
The paper analyzes insurance risk with Parisian ruin and capital injection.
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 . The Parisian …
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…
This paper presents some new results on Parisian ruin under Levy insurance risk process, where ruin occurs when the process has gone below a fixed level from the last record maximum, also known as the high-water mark or drawdown, for a fixed consecutive periods of time. The law of ruin-time and the position at ruin is …
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.…
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…
In this paper we analyze so-called Parisian ruin probability that happens when surplus process stays below zero longer than fixed amount of time . We focus on general spectrally negative Lévy insurance risk process. For this class of processes we identify expression for ruin probability in terms of some other quan…
In this paper we consider dividend problem for an insurance company whose risk evolves as a spectrally negative Lévy process (in the absence of dividend payments) when Parisian delay is applied. The objective function is given by the cumulative discounted dividends received until the moment of ruin when so-called barri…
In this paper, we introduce the concept of \emph{Poissonian occupation times} below level of spectrally negative Lévy processes. In this case, occupation time is accumulated only when the process is observed to be negative at arrival epochs of an independent Poisson process. Our results extend some well known conti…
In this paper, we obtain analytical expression for the distribution of the occupation time in the red (below level ) 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…
Solves optimal stopping problem with Poisson constraints using jumps.
Continuous-time optimal stopping solved with deep reinforcement learning
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…
New algorithms improve stopping time for best arm identification.
We consider the optimal double stopping time problem defined for each stopping time 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 …
Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.
We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games.
Solves optimal stopping for Gauss-Markov bridges using time-space transformation.
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…
In this paper, we propose several "measurements" of the "non-stopping timeness" of ends g of previsible sets, such that g avoids stopping times, in an ambiant filtration. We then study several explicit examples, involving last passage times of some remarkable martingales.
In this work we consider optimal stopping problems with conditional convex risk measures called optimised certainty equivalents. Without assuming any kind of time-consistency for the underlying family of risk measures, we derive a novel representation for the solution of the optimal stopping problem. In particular, we …
The paper tackles optimal stopping problems using reinforcement learning and singular control.
Early stopping method saves up to 75% computation time in policy search tasks.
Paper solves a complex stopping problem using regularization and HJB equations.
Study optimal stopping times under regime-switching models with constraints.
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…
Inspired by Strotz's consistent planning strategy, we formulate the infinite horizon mean-variance stopping problem as a subgame perfect Nash equilibrium in order to determine time consistent strategies with no regret. Equilibria among stopping times or randomized stopping times may not exist. This motivates us to cons…
New method models stopping times that can be equal with non-zero probability.
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…
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 …
This paper considers a time-inconsistent stopping problem in which the inconsistency arises from non-constant time preference rates. We show that the smooth pasting principle, the main approach that has been used to construct explicit solutions for conventional time-consistent optimal stopping problems, may fail under …
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…
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…
Existence of strong randomized equilibria in mean-field games with common noise.
Early stopping improves sample quality in latent diffusion models.
Motivated by the industry practice of pairs trading, we study the optimal timing strategies for trading a mean-reverting price spread. An optimal double stopping problem is formulated to analyze the timing to start and subsequently liquidate the position subject to transaction costs. Modeling the price spread by an Orn…
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…
A framework for robust exploration in reinforcement learning under ambiguity.
New algorithms use Gaussian processes to optimize stopping times in financial markets.
Probabilistic proof of smooth boundaries in optimal stopping problems.
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 …
This work bounds the run-time of nonconvex optimization with early stopping.
Given an initial (resp., terminal) probability measure (resp., ) on , we characterize those optimal stopping times that maximize or minimize the functional , , where is Brownian motion with initial law and with final distribution --once stop…
American options are studied in a general discrete market in the presence of proportional transaction costs, modelled as bid-ask spreads. Pricing algorithms and constructions of hedging strategies, stopping times and martingale representations are presented for short (seller's) and long (buyer's) positions in an Americ…
Improved algorithm for optimal stopping problems reduces runtime.
Study optimal stopping times for multi-dimensional processes with non-exponential discounting.