English

Binomial-tree approximation for time-inconsistent stopping

Optimization and Control 2024-12-30 v2 Probability

Abstract

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()V(\cdot) induced by all mild equilibria in the continuous-time problem, as well as the value Vh()V^h(\cdot) associated with the equilibria in a binomial-tree setting with time step size hh. We show that limh0+VhV\lim_{h\rightarrow 0+} V^h \leq V. We provide an example showing that the exact convergence may fail. Then we relax the set of equilibria and consider the value Vεh()V^h_{\varepsilon}(\cdot) induced by ε\varepsilon-equilibria in the binomial-tree model. We prove that limε0+limh0+Vεh=V\lim_{\varepsilon \rightarrow 0+}\lim_{h \rightarrow 0+}V^h_{\varepsilon} = V.

Keywords

Cite

@article{arxiv.2402.01482,
  title  = {Binomial-tree approximation for time-inconsistent stopping},
  author = {Erhan Bayraktar and Zhenhua Wang and Zhou Zhou},
  journal= {arXiv preprint arXiv:2402.01482},
  year   = {2024}
}
R2 v1 2026-06-28T14:35:58.302Z