Optimal Stopping for Systems Driven by the Brownian Sheet
Nacira Agram, Bernt Oksendal, Frank Proske, Olena Tymoshenko

TL;DR
This paper derives explicit solutions for optimal stopping problems involving the Brownian sheet, including threshold characterizations and potential theoretic analysis for systems driven by this stochastic process.
Contribution
It provides the first explicit solutions and a potential theoretic framework for two-parameter optimal stopping problems driven by the Brownian sheet.
Findings
Explicit optimal thresholds for specific stopping problems.
Representation of value functions using exponential integral functions.
Existence of optimal stopping points in the plane.
Abstract
We investigate optimal stopping problems for systems driven by the Brownian sheet. Our analysis is divided into two parts. In the first part we derive explicit solutions to two optimal stopping problems for the exponentially discounted Brownian sheet. The first problem consists in determining the optimal two-parameter first hitting point tau = (tau1,tau2) maximizing E[exp(-rho tau1 tau2) h(B(tau1,tau2))], where rho > 0 is a discount factor and h is a reward function. Restricting attention to first hitting points of levels, we obtain a closed-form characterization of the optimal stopping threshold. In particular, for linear rewards h(y)=y the optimal level is y_hat = (2 rho)^(-1/2). The second problem concerns optimal stopping of the integrated discounted Brownian sheet with payoff E[int_0^{tau1} int_0^{tau2} exp(-rho t x) B(t,x) dt dx]. We show that the optimal first hitting level…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications · Advanced Queuing Theory Analysis · Optimization and Search Problems
