Related papers: Optimal stopping for L\'evy processes and affine f…
We revisit a stochastic control problem of optimally modifying the underlying spectrally negative Levy process. A strategy must be absolutely continuous with respect to the Lebesgue measure, and the objective is to minimize the total costs…
We investigate the (functional) convex order of for various continuous martingale processes, either with respect to their diffusions coefficients for L\'evy-driven SDEs or their integrands for stochastic integrals. Main results are bordered…
The dynamical analysis of American options has motivated the development of robust versions of the classical Snell envelopes. The cost of superhedging an American option is characterized by the upper Snell envelope. The infimum of the…
Entropically regularized optimal transport between probability measures supported on compact subsets of Euclidean space admits a representation as an information projection under moment inequality constraints. Exploiting this structure, I…
We explore properties of the value function and existence of optimal stopping times for functionals with discontinuities related to the boundary of an open (possibly unbounded) set $\mathcal{O}$. The stopping horizon is either random, equal…
In this paper, we present a discrete-type approximation scheme to solve continuous-time optimal stopping problems based on fully non-Markovian continuous processes adapted to the Brownian motion filtration. The approximations satisfy…
In a classical problem for the stopping of a diffusion process $(X_t)_{t \geq 0}$, where the goal is to maximise the expected discounted value of a function of the stopped process ${\mathbb E}^x[e^{-\beta \tau}g(X_\tau)]$, maximisation…
Sequential Bayesian experimental design typically assumes that the number of experiments is fixed before data collection begins. In practical campaigns, however, experimentation may need to terminate early because additional measurements…
We consider the passage time problem for L\'evy processes, emphasising heavy tailed cases. Results are obtained under quite mild assumptions, namely, drift to $-\infty$ a.s. of the process, possibly at a linear rate (the finite mean case),…
In this paper, we present a novel method for computing the asymptotic values of both the optimal threshold, and the probability of success in sequences of optimal stopping problems. This method, based on the resolution of a first-order…
We suppose that a L\'evy process is observed at discrete time points. A rather general construction of minimum-distance estimators is shown to give consistent estimators of the L\'evy-Khinchine characteristics as the number of observations…
We study optimal stopping of Feller-Markov processes to maximise an undiscounted functional consisting of running and terminal rewards. In a finite-time horizon setting, we extend classical results to unbounded rewards. In infinite horizon,…
We extend the Longstaff-Schwartz algorithm for approximately solving optimal stopping problems on high-dimensional state spaces. We reformulate the optimal stopping problem for Markov processes in discrete time as a generalized statistical…
We study the small-time asymptotics of sample paths of L\'evy processes and L\'evy-type processes. Namely, we investigate under which conditions the limit $$\limsup_{t \to 0} \frac{1}{f(t)} |X_t-X_0|$$ is finite resp.\ infinite with…
The paper studies a class of multidimensional optimal stopping problems with infinite horizon for linear switching diffusions. There are two main novelties in the optimal problems considered: the underlying stochastic process has…
We present a novel theoretical result on estimation of local time and occupation time measure of an {\alpha}-stable L\'evy process with {\alpha} in (1, 2). Our approach is based upon computing the conditional expectation of the desired…
One way of improving the behavior of finite element schemes for classical, time-dependent Maxwell's equations, is to render them from their hyperbolic character to elliptic form. This paper is devoted to the study of the stabilized linear…
Early stopping of iterative algorithms is an algorithmic regularization method to avoid over-fitting in estimation and classification. In this paper, we show that early stopping can also be applied to obtain the minimax optimal testing in a…
In this paper we introduce and solve a class of optimal stopping problems of recursive type. In particular, the stopping payoff depends directly on the value function of the problem itself. In a multi-dimensional Markovian setting we show…
We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an…