On the public citation graph
The secretary problem with an unknown number of candidates
0 signed · 27 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02759948openalex-snapshot
Optimal selection based on relative rank (the “secretary problem”)
inferredcites →https://doi.org/10.1080/00401706.1968.10490555openalex-snapshot
Mathematical Statistics A Decision Theoretic Approach
inferredcites →https://doi.org/10.1080/01621459.1966.10502008openalex-snapshot
Recognizing the Maximum of a Sequence
inferredcites →https://doi.org/10.1137/1117078openalex-snapshot
The Best Choice Problem for a Random Number of Objects
inferredcites →https://doi.org/10.1214/aoms/1177728594openalex-snapshot
An Extension of Wald's Theory of Statistical Decision Functions
inferredcites →https://doi.org/10.2307/2985407openalex-snapshot
Dynamic Programming and Decision Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-5246-7_5openalex-snapshot
Statistical Methods in Medicine and Technology
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_29openalex-snapshot
On Variants of the Matroid Secretary Problem
inferred← citeshttps://doi.org/10.1007/s00453-013-9795-yopenalex-snapshot
On Variants of the Matroid Secretary Problem
inferred← citeshttps://doi.org/10.1016/0304-4149(94)00042-ropenalex-snapshot
The best-choice secretary problem with random freeze on jobs
inferred← citeshttps://doi.org/10.1016/j.spa.2021.04.011openalex-snapshot
The 1/e-strategy is sub-optimal for the problem of best choice under no information
inferred← citeshttps://doi.org/10.1016/j.spa.2021.12.008openalex-snapshot
The best choice problem with random arrivals: How to beat the 1 / e -strategy
inferred← citeshttps://doi.org/10.1017/s0021900200028722openalex-snapshot
Asymptotic results for the best-choice problem with a random number of objects
inferred← citeshttps://doi.org/10.1017/s0021900200116791openalex-snapshot
On an optimal selection problem of Cowan and Zabczyk
inferred← citeshttps://doi.org/10.1214/aop/1176990548openalex-snapshot
Minimax-Optimal Stop Rules and Distributions in Secretary Problems
inferred← citeshttps://doi.org/10.1214/aop/1176993237openalex-snapshot
A Unified Approach to a Class of Best Choice Problems with an Unknown Number of Options
inferred← citeshttps://doi.org/10.1214/ss/1177012493openalex-snapshot
Who Solved the Secretary Problem?
inferred← citeshttps://doi.org/10.1287/opre.2023.0636openalex-snapshot
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements
inferred← citeshttps://doi.org/10.2307/1402748openalex-snapshot
The Secretary Problem and Its Extensions: A Review
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4081openalex-snapshot
On Variants of the Matroid Secretary Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1809.07299openalex-snapshot
The Warm-starting Sequential Selection Problem and its Multi-round Extension
inferred← citeshttps://doi.org/10.48550/arxiv.2004.13749openalex-snapshot
On the $1/e$-strategy for the best-choice problem under no information
inferred← citeshttps://doi.org/10.48550/arxiv.2012.13288openalex-snapshot
Answer to an open question concerning the $1/e$-strategy for best choice under no information
inferred← citeshttps://doi.org/10.48550/arxiv.2102.10672openalex-snapshot
How to beat the 1/e-strategy of best choice (the random arrivals problem)
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.