Abstract
We consider the Brownian “spider,” a construct introduced in Dubins and Schwarz (1988) and in Barlow and Pitman (1989). 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
