Two explicit Skorokhod embeddings for simple symmetric random walk

2017/05/16 by Xuedong He, Sang Hu, He, Xuedong +5 · 1 citation
Mathematics · #60G40 #FOS: Mathematics #Probability (math.PR) #math.PR #msc:60G40

paper · pdf · doi:10.48550/arxiv.1705.05635

arxiv created 2018/09/27 · arxiv updated 2018/09/28

Abstract

Motivated by problems in behavioural finance, we provide two explicit constructions of a randomized stopping time which embeds a given centered distribution μ on integers into a simple symmetric random walk in a uniformly integrable manner. Our first construction has a simple Markovian structure: at each step, we stop if an independent coin with a state-dependent bias returns tails. Our second construction is a discrete analogue of the celebrated Azéma-Yor solution and requires independent coin tosses only when excursions away from maximum breach predefined levels. Further, this construction maximizes the distribution of the stopped running maximum among all uniformly integrable embeddings of μ.

Cited by

• Optimal exit strategies of CPT gamblers in unfair gambles

Related

• Classes of Skorokhod Embeddings for the Simple Symmetric Random Walk
• Delayed switching identities and multi-marginal solutions to the Skorokhod embedding problem
• Fine Properties of the Optimal Skorokhod Embedding Problem
• Perkins Embedding for General Starting Laws
• Skorokhod embeddings, minimality and non-centred target distributions