Papers › Optimal stopping of an Ornstein-Uhlenbeck bridge
Optimal stopping of an Ornstein-Uhlenbeck bridge
Abel Azze, Bernardo D'Auria, Eduardo García-Portugués
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We make a rigorous analysis of the existence and characterization of the free boundary related to the optimal stopping problem that maximizes the mean of an Ornstein--Uhlenbeck bridge. The result includes the Brownian bridge problem as a limit case. The methodology hereby presented relies on a time-space transformation that casts the original problem into a more tractable one with an infinite horizon and a Brownian motion underneath. We comment on two different numerical algorithms to compute the free-boundary equation and discuss illustrative cases that shed light on the boundary's shape. In particular, the free boundary generally does not share the monotonicity of the Brownian bridge case.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections