arXiv (All)
open access
Settling the Matroid Secretary Problem
This paper settles the Matroid Secretary Problem with an $e$-probability-competitive algorithm. The algorithm is ordinal and accesses arrived elements only through comparison and independence oracles, and has expected polynomial time and oracle complexity.
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
- Convergence of some leader election algorithms#970906
- Arrival-Time Incentive Compatibility in Random Order Online Bipartite Matching#1131153
- Randomized Algorithms#3284
- More Efficient Parallel $(Δ+1)$-Edge Coloring#1130345
- Sequential Pricing Mechanisms for Surplus Division#924902
Record · ID 1104620
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