arXiv (All)
open access
Least-Favorable Location for Binomial Top-$t$ Selection
Consider $k$ independent Bernoulli populations, each sampled $n$ times, and select the $t$ populations with the largest success counts, breaking ties uniformly. Classical monotonicity reduces the worst case over the preference zone with separation $δ$ to the slippage family with levels $p$ and $p+δ$
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
- Local large deviations for triangles in sparse random graphs#1036279
- Improved upper bounds on the list chromatic number of $K_t$-minor-free graphs#1157217
- BiAxisBias: Evaluating LLM Bias Beyond a Single Prompt and a Single Explanation#618062
- Approximations for the number of maxima and near-maxima in independent data#128384
- Structural and computational aspects of majority coloring games#1142104
Record · ID 926385
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