arXiv (All)
open access
Monotone Multiple Stopping and Last-Success Problems
An optimal stopping problem is monotone when its stopping region is preserved under subsequent transitions, so that the one-step look-ahead stopping time is optimal. We develop a finite-horizon discrete-time theory of multiple stopping that separates general recursive dynamic programming from this s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#635508
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#633159
- Optimal Stopping Problems with Generalized Objective Functions#448428
- Selection of Order of Observation in Optimal Stopping Problems#322177
- Minimax-Optimal Early Stopping for Continuous-Time SGD via the Discrepancy Principle#998814
Record · ID 1234604
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive