Related papers: Optimal Stopping with Rank-Dependent Loss

In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review of the linear ordering problem (LOP) and then use it to…

We consider a nonlinear system, affine with respect to an unbounded control $u$ which is allowed to range in a closed cone. To this system we associate a Bolza type minimum problem, with a Lagrangian having sublinear growth with respect to…

Given an initial (resp., terminal) probability measure $\mu$ (resp., $\nu$) on $\mathbb{R}^d$, we characterize those optimal stopping times $\tau$ that maximize or minimize the functional $\mathbb{E} |B_0 - B_\tau|^{\alpha}$, $\alpha > 0$,…

Various algorithms in reinforcement learning exhibit dramatic variability in their convergence rates and ultimate accuracy as a function of the problem structure. Such instance-specific behavior is not captured by existing global minimax…

Let X_t, 0<=t<=T be a one-dimensional stochastic process with independent and stationary increments. This paper considers the problem of stopping the process X_t "as close as possible" to its eventual supremum M_T:=sup{X_t: 0<=t<=T}, when…

We investigate an entropy-regularized reinforcement learning (RL) approach to optimal stopping problems motivated by real option models. Classical stopping rules are strict and non-randomized, limiting natural exploration in RL settings. To…

This paper concerns an optimal stopping problem driven by the running maximum of a spectrally negative Levy process X. More precisely, we are interested in capped versions of the American lookback optimal stopping problem, which has its…

Given a stable L\'{e}vy process $X=(X_t)_{0\le t\le T}$ of index $\alpha\in(1,2)$ with no negative jumps, and letting $S_t=\sup_{0\le s\le t}X_s$ denote its running supremum for $t\in [0,T]$, we consider the optimal prediction problem…

Given two probability measures $\mu, \nu$ on $\mathbb{R}^d$, in subharmonic order, we describe optimal stopping times $\tau$ that maximize/minimize the cost functional $\mathbb{E} |B_0 - B_\tau|^{\alpha}$, $\alpha > 0$, where $(B_t)_t$ is…

We propose and analyze a continuous-time robust reinforcement learning framework for optimal stopping under ambiguity. In this framework, an agent chooses a robust exploratory stopping time motivated by two objectives: robust…

We consider the optimal stopping problem for a Gauss-Markov process conditioned to adopt a prescribed terminal distribution. By applying a time-space transformation, we show it is equivalent to stopping a Brownian bridge pinned at a random…

In this paper we develop a deep learning method for optimal stopping problems which directly learns the optimal stopping rule from Monte Carlo samples. As such, it is broadly applicable in situations where the underlying randomness can…

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…

Suppose $N$ independent Bernoulli trials are observed sequentially at random times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. We focus…

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…

In real-world reinforcement learning (RL) systems, various forms of {\it impaired observability} can complicate matters. These situations arise when an agent is unable to observe the most recent state of the system due to latency or lossy…

We consider the L\'evy model of the perpetual American call and put options with a negative discount rate under Poisson observations. Similar to the continuous observation case as in De Donno et al. [24], the stopping region that…

We solve an optimal stopping problem where the underlying diffusion is Brownian motion on $\bf R$ with a positive drift changing at zero. It is assumed that the drift $\mu_1$ on the negative side is smaller than the drift $\mu_2$ on the…

We introduce a notion of bounded variation solution for a new class of nonlinear control systems with ordinary and impulsive controls, in which the drift function depends not only on the state, but also on its past history, through a finite…

We consider the problem of binary classification with abstention in the relatively less studied \emph{bounded-rate} setting. We begin by obtaining a characterization of the Bayes optimal classifier for an arbitrary input-label distribution…