Related papers: Convergence of values in optimal stopping

We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to $c \cdot n^\alpha$ are…

The article considers systems of interacting particles on networks with adaptively coupled dynamics. Such processes appear frequently in natural processes and applications. Relying on the notion of graph convergence, we prove that for large…

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

We analyze an optimal stopping problem with random maturity under a nonlinear expectation with respect to a weakly compact set of mutually singular probabilities $\mathcal{P}$. The maturity is specified as the hitting time to level $0$ of…

Consider a set of discounted optimal stopping problems for a one-parameter family of objective functions and a fixed diffusion process, started at a fixed point. A standard problem in stochastic control/optimal stopping is to solve for the…

Approximating the solution of the nonlinear filtering problem with Gaussian mixtures has been a very popular method since the 1970s. However, the vast majority of such approximations are introduced in an ad-hoc manner without theoretical…

We show that the centered maximum of a sequence of log-correlated Gaussian fields in any dimension converges in distribution, under the assumption that the covariances of the fields converge in a suitable sense. We identify the limit as a…

We consider the optimal stopping problem with non-linear $f$-expectation (induced by a BSDE) without making any regularity assumptions on the reward process $\xi$. and with general filtration. We show that the value family can be aggregated…

This paper is a continuation of work arXiv:2006.09583 devoted to establishment of the convergence rate in the strong invariance principle for cumulative processes. We establish optimal rate of convergence for the case when regeneration…

We consider point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the largest extremes of these random walks. We show convergence of the maximum random walk to the Gumbel or the…

In the first part of this paper, we study RBSDEs in the case where the filtration is not quasi-left continuous and the lower obstacle is given by a predictable process. We prove the existence and uniqueness by using some results of optimal…

Convergence of the ensemble Kalman filter in the limit for large ensembles to the Kalman filter is proved. In each step of the filter, convergence of the ensemble sample covariance follows from a weak law of large numbers for exchangeable…

We characterize the value function and the optimal stopping time for a large class of optimal stopping problems where the underlying process to be stopped is a fairly general Markov process. The main result is inspired by recent findings…

Our purpose is to study a particular class of optimal stopping problems for Markov processes. We justify the value function convexity and we deduce that there exists a boundary function such that the smallest optimal stopping time is the…

We provide a characterization of an optimal stopping time for a class of finite horizon time-inconsistent optimal stopping problems (OSPs) of mean-field type, adapted to the Brownian filtration, including those related to mean-field…

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…

Action convergence provides a limit theory for linear bounded operators $A_n:L^{\infty}(\Omega_n)\longrightarrow L^1(\Omega_n)$ where $\Omega_n$ are potentially different probability spaces. This notion of convergence emerged in graph…

In this research, an optimal algorithm for the Collatz conjecture is presented. Properties such as the convergence of the algorithm and an equation that relates the algorithm to the classical Collatz conjecture are obtained. It is validated…

In this Note we study optimal stopping problems for strong Markov processes and affine functions. We give a justification of the Snell envelope form using standard results of optimal stopping. We also justify the convexity of the value…

In this paper we study progressive filtration expansions with c\`adl\`ag processes. Using results from the theory of the weak convergence of $\sigma$-fields, we first establish a semimartingale convergence theorem. Then we apply it in a…