2000 character limit reached
Random Stopping Times in Stopping Problems and Stopping Games (1211.5802v1)
Published 25 Nov 2012 in math.PR
Abstract: Three notions of random stopping times exist in the literature. We introduce two concepts of equivalence of random stopping times, motivated by optimal stopping problems and stopping games respectively. We prove that these two concepts coincide and that the three notions of random stopping times are equivalent.
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.