arXiv (All)
open access
The Pareto Secretary Problem
The Pareto secretary problem asks for online selection of a Pareto-maximal observation from an i.i.d. sample: no other observation is at least as good in every coordinate and strictly better in one. For every fixed dimension $d\ge2$ and independent continuous coordinates, the optimal failure probabi
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
- Variance Bounds for Minimum Perfect Matching Problem by Random Walk on Multinomial Distribution#1324938
- Continuity and completeness of strongly independent preorders#752029
- Latent Order Bandits#629999
- Latent Order Bandits#628137
- Robust Wasserstein barycenter#793592
Record · ID 1535409
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