Related papers: Optimal double stopping time

This paper studies an optimal stopping problem for L\'evy processes. We give a justification of the form of the Snell envelope using standard results of optimal stopping. We also justify the convexity of the value function, and without a…

We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…

We consider the non-linear optimal multiple stopping problem under general conditions on the non-linear evaluation operators, which might depend on two time indices: the time of evaluation/assessment and the horizon (when the reward or loss…

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…

In this paper, we consider the optimal stopping problem on semi-Markov processes (SMPs) with finite horizon, and aim to establish the existence and computation of optimal stopping times. To achieve the goal, we first develop the main…

We introduce a new formulation of reflected BSDEs and doubly reflected BSDEs associated with irregular obstacles. In the first part of the paper, we consider an extension of the classical optimal stopping problem over a larger set of…

For an infinite-horizon continuous-time optimal stopping problem under non-exponential discounting, we look for an optimal equilibrium, which generates larger values than any other equilibrium does on the entire state space. When the…

Standard Markovian optimal stopping problems are consistent in the sense that the first entrance time into the stopping set is optimal for each initial state of the process. Clearly, the usual concept of optimality cannot in a…

In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is…

A novel quickest detection setting is proposed which is a generalization of the well-known Bayesian change-point detection model. Suppose \{(X_i,Y_i)\}_{i\geq 1} is a sequence of pairs of random variables, and that S is a stopping time with…

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.…

We consider the optimal stopping time problem under model uncertainty $R(v)= {\text{ess}\sup\limits}_{ \mathbb{P} \in \mathcal{P}} {\text{ess}\sup\limits}_{\tau \in \mathcal{S}_v} E^\mathbb{P}[Y(\tau) \vert \mathcal{F}_v]$, for every…

We study two-player zero-sum stopping games in continuous time and infinite horizon. We prove that the value in randomized stopping times exists as soon as the payoff processes are right-continuous. In particular, as opposed to existing…

Let $X$ be a one-dimensional diffusion and let $g\colon[0,T]\times\mathbb{R}\to\mathbb{R}$ be a payoff function depending on time and the value of $X$. The paper analyzes the inverse optimal stopping problem of finding a time-dependent…

This paper explores continuous-time and state-space optimal stopping problems from a reinforcement learning perspective. We begin by formulating the stopping problem using randomized stopping times, where the decision maker's control is…

This paper considers a pair $(\mathbb{F},\tau)$, where $\mathbb{F}$ is a filtration representing the "public" flow of information which is available to all agents overtime, and $\tau$ is a random time which might not be an…

We consider the optimal stopping problem $v^{(\eps)}:=\sup_{\tau\in\mathcal{T}_{0,T}}\mathbb{E}B_{(\tau-\eps)^+}$ posed by Shiryaev at the International Conference on Advanced Stochastic Optimization Problems organized by the Steklov…

We investigate optimal stopping problems for systems driven by the Brownian sheet. Our analysis is divided into two parts. In the first part we derive explicit solutions to two optimal stopping problems for the exponentially discounted…

We introduce a new non-zero-sum game of optimal stopping with asymmetric exercise opportunities. Given a stochastic process modelling the value of an asset, one player observes and can act on the process continuously, while the other player…

This paper attempts to study the optimal stopping time for semi-Markov processes (SMPs) under the discount optimization criteria with unbounded cost rates. In our work, we introduce an explicit construction of the equivalent semi-Markov…