OpenAlex ·
Multiple Stopping Options on a Geometric Random Walk
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.30239
- Original
- Read it at the publisher
- Topics
Abstract
This article develops a finite-horizon multiple-stopping framework and applies it to three American-style contracts on a geometric random walk in a Cox--Ross--Rubinstein market: an American put, a Russian option, and a floating-strike geometric-average Asian put. The general problem is represented by recursively defined Snell envelopes, with unused exercise rights encoded by a cemetery time; this yields an ordered optimal exercise vector without requiring all rights to be exercised. For the American put, a median representation of successive marginal values yields diminishing marginal values, nested exercise regions, and monotone exercise thresholds without relying on convexity of the marginal value. After suitable state reductions, analogous marginal-value arguments give threshold-type optimal exercise rules for the Russian and geometric-average Asian options. Independent random maturity is also incorporated, and its effect on the corresponding stopping regions is identified.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Optimization & Control
Functional Architecture of European Electricity Trading Markets: Requirements for AI Supported Trading Systems under Regulatory Constraints
Financial Fragility in Societies of LLM Agents: Coordination Failures and Stabilizing Mechanisms
Same Text, Different Numbers: The Divergence of LLM-Based Measures
Constants in the Weighted Law of the Iterated Logarithm under Long-Range Dependence: Hermite Rank Two
Multi-Jurisdictional Legal Identity Assurance for Capability Gating: A Design-Science Proposal for Tiered, Reusable Identity Assurance of Natural, Juridical, and Machine Entities
Get the few papers worth your time in Optimization & Control every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.