arXiv (All)
open access
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities
We study prophet inequalities under intersections of $q$ partition matroids, where an online algorithm irrevocably selects elements with independent nonnegative values drawn from known distributions and revealed in an adversarial order. We prove an $Ω(q/\log q)$ lower bound on the competitive ratio.
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
- The Tutte polynomial determines the linear coefficient of the Ehrhart polynomial#792577
- The Tutte polynomial determines the linear coefficient of the Ehrhart polynomial#788577
- A product inequality and its application to cross-intersecting families#1117899
- Unsound Search with Policy and Value Networks in Legends of Code and Magic#974903
- Eleven, twelve, and thirteen lonely runners#819353
Record · ID 1034496
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