English
Related papers

Related papers: Recombining Tree Approximations for Optimal Stoppi…

200 papers

In this paper we introduce a numerical method for optimal stopping in the framework of one dimensional diffusion. We use the Skorokhod embedding in order to construct recombining tree approximations for diffusions with general coefficients.…

Mathematical Finance · Quantitative Finance 2020-07-14 Benjamin Gottesman Berdah

Given a Brownian motion $B_t$ and a general target law $\mu$ (not necessarily centered or even integrable) we show how to construct an embedding of $\mu$ in $B$. This embedding is an extension of an embedding due to Perkins, and is optimal…

Probability · Mathematics 2007-05-23 A. M. G. Cox , D. G. Hobson

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…

Probability · Mathematics 2010-05-04 David Hobson , Martin Klimmek

We study a problem when a solution to optimal stopping problem for one-dimensional diffusion will generate by threshold strategy. Namely, we give necessary and sufficient conditions under which an optimal stopping time can be specified as…

Probability · Mathematics 2013-06-20 V. I. Arkin , A. D. Slastnikov

The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod…

Probability · Mathematics 2016-08-04 Gaoyue Guo , Xiaolu Tan , Nizar Touzi

We investigate quantifying the difference between two hybrid dynamical systems under noise and initial-state uncertainty. While the set of traces for these systems is infinite, it is possible to symbolically approximate trace sets using…

Systems and Control · Computer Science 2016-02-16 Rupak Majumdar , Vinayak S. Prabhu

In this paper we consider the Skorokhod embedding problem for target distributions with non-zero mean. In the zero-mean case, uniform integrability provides a natural restriction on the class of embeddings, but this is no longer suitable…

Probability · Mathematics 2007-05-23 Alexander Cox , David Hobson

We solve the Skorokhod embedding problem for a class of stochastic processes satisfying an inhomogeneous stochastic differential equation (SDE) of the form $d A_t =\mu (t, A_t) d t + \sigma(t, A_t) d W_t$. We provide sufficient conditions…

Probability · Mathematics 2019-06-19 Stefan Ankirchner , Stefan Engelhardt , Alexander Fromm , Goncalo dos Reis

Decision trees and diffusion models are ostensibly disparate model classes, one discrete and hierarchical, the other continuous and dynamic. This work unifies the two by establishing a crisp mathematical correspondence between hierarchical…

Machine Learning · Computer Science 2026-05-22 Sai Niranjan Ramachandran , Suvrit Sra

We derive the optimal rate of convergence for the mean squared error at the terminal point for anticipating linear stochastic differential equations, where the integral is interpreted in Skorohod sense. Although alternative proof techniques…

Probability · Mathematics 2022-08-02 Peter Parczewski

Considering a real-valued diffusion, a real-valued reward function and a positive discount rate, we provide an algorithm to solve the optimal stopping problem consisting in finding the optimal expected discounted reward and the optimal…

Probability · Mathematics 2019-09-24 Fabián Crocce , Ernesto Mordecki

For time-inconsistent stopping in a one-dimensional diffusion setup, we investigate how to use discrete-time models to approximate the original problem. In particular, we consider the value function $V(\cdot)$ induced by all mild equilibria…

Optimization and Control · Mathematics 2024-12-30 Erhan Bayraktar , Zhenhua Wang , Zhou Zhou

We consider the problem of optimal stopping for a one-dimensional diffusion process. Two classes of admissible stopping times are considered. The first class consists of all nonanticipating stopping times that take values in [0,\infty],…

Probability · Mathematics 2007-05-23 Paul Dupuis , Hui Wang

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…

Probability · Mathematics 2021-08-02 Philip Ernst , Hongwei Mei

This paper provides a full characterization of the value function and solution(s) of an optimal stopping problem for a one-dimensional diffusion with an integral criterion. The results hold under very weak assumptions, namely, the diffusion…

Probability · Mathematics 2017-03-21 Manuel Guerra , Cláudia Nunes , Carlos Oliveira

We investigate the optimal stopping problems involving the supremum of a diffusion. The starting point is the link between works of Peskir and Meilijson, which we describe in a unified manner. The description developped follows mainly the…

Probability · Mathematics 2007-05-23 Jan Obloj

The Skorokhod embedding problem is to represent a given probability as the distribution of Brownian motion at a chosen stopping time. Over the last 50 years this has become one of the important classical problems in probability theory and a…

Probability · Mathematics 2016-05-16 Mathias Beiglboeck , Alexander M. G. Cox , Martin Huesmann

A general result on the method of randomized stopping is proved. It is applied to optimal stopping of controlled diffusion processes with unbounded coefficients to reduce it to an optimal control problem without stopping. This is motivated…

Probability · Mathematics 2008-05-15 Istvan Gyongy , David Siska

Diffusion models have become the go-to method for large-scale generative models in real-world applications. These applications often involve data distributions confined within bounded domains, typically requiring ad-hoc thresholding…

Machine Learning · Statistics 2024-01-09 Wei Deng , Yu Chen , Nicole Tianjiao Yang , Hengrong Du , Qi Feng , Ricky T. Q. Chen

We propose a principled method for autoencoding with random forests. Our strategy builds on foundational results from nonparametric statistics and spectral graph theory to learn a low-dimensional embedding of the model that optimally…

Machine Learning · Statistics 2026-01-16 Binh Duc Vu , Jan Kapar , Marvin Wright , David S. Watson
‹ Prev 1 2 3 10 Next ›