arXiv (All)
open access
Sample-Based Prophet Inequalities for Random Walks
We study prophet inequalities for a random walk reward stopping problem with sample-based information. The goal is to stop as close as possible to the maximum of a random walk with i.i.d. increments, measuring performance by the ratio between the expected reward when stopping and the expected true m
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
- Minimization Prophet Inequality with Bounded Costs#974040
- Aperiodic random walks: uniform estimates, local limits and invariance principles#924157
- Aperiodic random walks: uniform estimates, local limits and invariance principles#919926
- Improved Bounds for Coin Flipping, Leader Election, and Random Selection#179140
- Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs#612830
Record · ID 1061922
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