arXiv (OAI Expanded)
open access
Asymptotic Rounding Laws for Optimal Thresholds in Secretary Problems
We study second-order asymptotics for optimal thresholds in secretary-type problems. Under a unimodality assumption and a local affine expansion of the discrete payoff increments, we establish a general principle showing that sufficiently accurate rational approximations to the leading threshold pro
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
- Asymptotic Rounding Laws for Optimal Thresholds in Secretary Problems#793911
- Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness#1062558
- Uniform Estimates for Integers with a Large Smooth Part#1141829
- Variation of cost functions in integer programming#429997
- Contextual Fraction Beyond Satisfiability: Pure NAE Completeness, Exact Orbit Packings, and Width Barriers#1034049
Record · ID 789892
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