Pith. sign in

REVIEW

Recursive Optimal Stopping with Poisson Stopping Constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.17975 v2 pith:WYP2A2MC submitted 2024-07-25 math.OC q-fin.MF

classification math.OCq-fin.MF
keywords stoppingpoissonproblemrecursivetimesconstraintsjumpsoptimal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper solves a recursive optimal stopping problem with Poisson stopping constraints using the penalized backward stochastic differential equation (PBSDE) with jumps. Stopping in this problem is only allowed at Poisson random intervention times, and jumps play a significant role not only through the stopping times but also in the recursive objective functional and model coefficients. To solve the problem, we propose a decomposition method based on Jacod-Pham that allows us to separate the problem into a series of sub-problems between each pair of consecutive Poisson stopping times. To represent the value function of the recursive optimal stopping problem when the initial time falls between two consecutive Poisson stopping times and the generator is concave/convex, we leverage the comparison theorem of BSDEs with jumps. We then apply the representation result to American option pricing in a nonlinear market with Poisson stopping constraints.

Discussion (0). Continue with ORCID to comment.

Pith tools