arXiv (All)
open access
Simple and Almost Non-Adaptive \(\frac{1}{2}\)-Approximation for Matroid Prophet Inequalities
Prophet inequalities are a fundamental model for online decision-making under uncertainty. For matroid constraints, Kleinberg and Weinberg gave a tight $\frac{1}{2}$-approximation using adaptive thresholds, while Feldman, Svensson, and Zenklusen obtained a $\frac{1}{4}$-approximation via an online c
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
- Disagreeing About What the Buyer Might Learn#1117769
- Prophet Inequalities and Online Contention Resolution for Matchoids#1034913
- Variable Bound Tightening for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games#307049
- Near-Optimal Distributed Domination in Planar Graphs#1117067
- Truth Revelation, Information Hiding, or Misinformation: Characterization of Equilibrium Outcomes in Signaling Games#972551
Record · ID 973276
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