On data-based optimal stopping under stationarity and ergodicity

From MaRDI portal
Publication:358137

DOI10.3150/12-BEJ439zbMATH Open1273.62192arXiv1307.5976OpenAlexW3103370543MaRDI QIDQ358137FDOQ358137


Authors: Harro Walk, Michael Kohler Edit this on Wikidata


Publication date: 16 August 2013

Published in: Bernoulli (Search for Journal in Brave)

Abstract: The problem of optimal stopping with finite horizon in discrete time is considered in view of maximizing the expected gain. The algorithm proposed in this paper is completely nonparametric in the sense that it uses observed data from the past of the process up to time n+1, ninmathbbN, not relying on any specific model assumption. Kernel regression estimation of conditional expectations and prediction theory of individual sequences are used as tools. It is shown that the algorithm is universally consistent: the achieved expected gain converges to the optimal value for noinfty whenever the underlying process is stationary and ergodic. An application to exercising American options is given, and the algorithm is illustrated by simulated data.


Full work available at URL: https://arxiv.org/abs/1307.5976




Recommendations




Cites Work


Cited In (4)





This page was built for publication: On data-based optimal stopping under stationarity and ergodicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358137)