Unverified50% confidenceFactExact time
Under the assumption that the input order is uniformly random, the competitive ratio of the classic strategy for the secretary problem (first rejecting the first n/e candidates, then selecting the first applicant better than all previous candidates) is approximately 1/e≈0.368, that is, the best candidate can be selected with a probability of at least 37%, and this ratio is optimal.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe winner determination logic is to first sort by average score from highest to lowest; if average scores are tied, completion rate is compared; if still tied, the one with fewer steps wins.67% similarUnverifiedThe best-of-8 selection strategy refers to generating 8 candidate outputs for the same prompt and then picking the best, which can significantly improve evaluation scores but roughly increases inference cost by 8 times; comparing a system using this strategy with a single-sample system is not entirely fair.67% similarUnverifiedAnswer balancing requires that the yes/no labels of each question type be roughly matched in distribution, so that the expected accuracy of random guessing stays around 50%.65% similarUnverifiedUsing randomInteger % n directly produces modulo bias: with 256 possible values and 10 entries, for example, the first 6 entries have a probability of about 10.16% and the last 4 about 9.77%, a relative deviation of about 4%.65% similarUnverifiedThe researchers drew 60 decisions from the late stage of each model's matches and, when the records were sufficient, compared the changes in probability distributions under three conditions: the original question, a repeated question, and removing the records.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1129824API
curl https://kongchang.com/api/v1/knowledge/claims/1129824MCP
get_claim(id=1129824)