Exercising Control When Confronted by a (Brownian) Spider
classification
🧮 math.PR
keywords
spiderbrownianciteauthorboundsconfrontedconsiderconstruct
read the original abstract
We consider the Brownian "spider," a construct introduced in \cite{Dubins} and in \cite{Pitman}. In this note, the author proves the "spider" bounds by using the dynamic programming strategy of guessing the optimal reward function and subsequently establishing its optimality by proving its excessiveness.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.