arXiv (All)
open access
Secretary Problems with Interactive Ordinal Queries
We study secretary problems in which the online algorithm can ask a reliable oracle a limited number of ordinal queries about unseen elements. Values are revealed only when elements arrive, and all accept/reject decisions are irrevocable. The oracle never reveals numerical values; it only answers qu
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
- DBRepro: Automated Database Synthesis via a Hybrid Constraint-Solving Approach for Reproducing Slow Queries#618639
- When Should Queries Be Decomposed? A Stage-Aware Study of Query Decomposition for Multi-Condition Retrieval#677634
- When Should Queries Be Decomposed? A Stage-Aware Study of Query Decomposition for Multi-Condition Retrieval#674433
- Enabling Data Dependency-based Query Optimization#158629
- AVPKEET: Exact-Request Authorization and Publicly Verifiable Equality Testing over Encrypted Data#677629
Record · ID 1013227
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