2000 character limit reached
Optimal double stopping of a Brownian bridge
Published 8 Sep 2014 in math.OC and q-fin.MF | (1409.2226v2)
Abstract: We study optimal double stopping problems driven by a Brownian bridge. The objective is to maximize the expected spread between the payoffs achieved at the two stopping times. We study several cases where the solutions can be solved explicitly by strategies of threshold type.
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.