Related papers: Optimal stopping under g_\Gamma expectation
We solve the problem of optimal stopping of a Brownian motion subject to the constraint that the stopping time's distribution is a given measure consisting of finitely-many atoms. In particular, we show that this problem can be converted to…
In this article, we study the classical finite-horizon optimal stopping problem for multidimensional diffusions through an approach that differs from what is typically found in the literature. More specifically, we first prove a key…
We adapt ideas and concepts developed in optimal transport (and its martingale variant) to give a geometric description of optimal stopping times of Brownian motion subject to the constraint that the distribution of the stopping time is a…
This paper concerns optimal stopping problems driven by the running maximum of a spectrally negative L\'{e}vy process $X$. More precisely, we are interested in modifications of the Shepp-Shiryaev optimal stopping problem [Avram, Kyprianou…
The objective of this paper is to establish the decomposition theorem for supermartingales under the $G$-framework. We first introduce a $g$-nonlinear expectation via a kind of $G$-BSDE and the associated supermartingales. We have shown…
We consider the representation of the value of a class of optimal stopping problems of linear diffusions in a linearized form as an expected supremum of a known function. We establish an explicit integral representation of this representing…
A classical optimal control problem posed in the whole space R^2 is perturbed by a singular term of magnitude $\epsilon$^{-1} aimed at driving the trajectories to a prescribed network $\Gamma$. We are interested in the link between the…
In this paper, we solve explicitly the optimal stopping problem with random discounting and an additive functional as cost of observations for a regular linear diffusion. We also extend the results to the class of one-sided regular Feller…
In this paper, we solve an open problem and obtain a general maximum principle for a stochastic optimal control problem where the control domain is an arbitrary non-empty set and all the coefficients (especially the diffusion term and the…
We summarize the general results of El Karoui [1981] on optimal stopping problems for processes which are measurable with respect to Meyer-$\sigma$-fields. Meyer-$\sigma$-fields are due to Lenglart [1980] and include the optional and…
A version of the Dynamical Systems Gradient Method for solving ill-posed nonlinear monotone operator equations is studied in this paper. A discrepancy principle is proposed and justified. A numerical experiment was carried out with the new…
This paper studies a class of random nonlinear systems with time-varying delay, in which the $r$-order moment ($r\geq1$) of the random disturbance is finite. Firstly, some general conditions are proposed to guarantee the existence and…
This paper investigates the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for solving monotone variational inequality problems. The exact worst case convergence rate is computed using the performance…
The strategy of early stopping is a regularization technique based on choosing a stopping time for an iterative algorithm. Focusing on non-parametric regression in a reproducing kernel Hilbert space, we analyze the early stopping strategy…
In this paper we study simulation based optimization algorithms for solving discrete time optimal stopping problems. This type of algorithms became popular among practioneers working in the area of quantitative finance. Using large…
We study a class of nonlinear nonparametric inverse problems. Specifically, we propose a nonparametric estimator of the dynamics of a monotonically increasing trajectory defined on a finite time interval. Under suitable regularity…
We identify the integrable stopping time $\tau_*$ with minimal $L^1$-distance to the last-passage time $\gamma_z$ to a given level $z>0$, for an arbitrary non-negative time-homogeneous transient diffusion $X$. We demonstrate that $\tau_*$…
Most of the real-time implementations of the stabilizing optimal control actions suffer from the necessity to provide high computational effort. This paper presents a cutting-edge approach for real-time evaluation of linear-quadratic model…
This paper extends our previous work to continuous-time optimal stopping, focusing on American options in an exploratory setting. Our first contribution is an entropy-regularized penalization scheme, inspired by classical penalization…
The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hard bicriteria optimization problem on graphs with $n$ vertices and $m$ edges. In a graph where each edge is assigned a…