2000 character limit reached
Numerical method for optimal stopping of piecewise deterministic Markov processes
Published 12 Mar 2009 in math.PR | (0903.2114v2)
Abstract: We propose a numerical method to approximate the value function for the optimal stopping problem of a piecewise deterministic Markov process (PDMP). Our approach is based on quantization of the post jump location---inter-arrival time Markov chain naturally embedded in the PDMP, and path-adapted time discretization grids. It allows us to derive bounds for the convergence rate of the algorithm and to provide a computable $\epsilon$-optimal stopping time. The paper is illustrated by a numerical example.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.