On the public citation graph

Optimal selection based on relative ranks with a random number of individuals

0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00933340openalex-snapshot
A generalized choice problem
inferredcites →https://doi.org/10.1007/bf02759948openalex-snapshot
Optimal selection based on relative rank (the “secretary problem”)
inferredcites →https://doi.org/10.1017/s0021900200048658openalex-snapshot
The candidate problem with unknown population size
inferredcites →https://doi.org/10.1137/1117078openalex-snapshot
The Best Choice Problem for a Random Number of Objects
inferredcites →https://doi.org/10.1214/aop/1176996090openalex-snapshot
The Infinite Secretary Problem
inferredcites →https://doi.org/10.1214/aop/1176996936openalex-snapshot
On a Class of Secretary Problems
inferredcites →https://doi.org/10.1214/aos/1193342386openalex-snapshot
Differential Equations and Optimal Choice Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.2794151openalex-extracted
Probabilistic Interpretation
inferred← citeshttps://doi.org/10.1002/0471667196.ess2372openalex-snapshot
Secretary Problem
inferred← citeshttps://doi.org/10.1002/0471667196.ess2372.pub2openalex-snapshot
Secretary Problem
inferred← citeshttps://doi.org/10.1002/1099-0771(200010/12)13:4<391::aid-bdm359>3.0.co;2-iopenalex-snapshot
Optimal stopping behavior with relative ranks: the secretary problem with unknown population size
inferred← citeshttps://doi.org/10.1002/9781118445112.stat01812openalex-snapshot
Secretary Problem
inferred← citeshttps://doi.org/10.1006/obhd.1997.2683openalex-snapshot
Sequential Decision Making with Relative Ranks: An Experimental Investigation of the "Secretary Problem">
inferred← citeshttps://doi.org/10.1007/978-3-642-12834-9_11openalex-snapshot
Estimating Optimal Stopping Rules in the Multiple Best Choice Problem with Minimal Summarized Rank via the Cross-Entropy Method
inferred← citeshttps://doi.org/10.1007/978-3-662-03366-1_34openalex-snapshot
Searching for the Next Best Mate
inferred← citeshttps://doi.org/10.1007/bf00934083openalex-snapshot
Selection of nonextremal candidates from a random sequence
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/s0001867800022370openalex-snapshot
Best-choice problems involving recall and uncertainty of selection when the number of observations is random
inferred← citeshttps://doi.org/10.1017/s0001867800022382openalex-snapshot
Optimal selection based on relative ranks of a sequence by ties
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/s0021900200097035openalex-snapshot
On the best-choice problem when the number of observations is random
inferred← citeshttps://doi.org/10.1081/sqa-200056196openalex-snapshot
Objectives in the Best-Choice Problems
inferred← citeshttps://doi.org/10.1109/cec.2009.4983142openalex-snapshot
Estimating optimal stopping rules in the multiple best choice problem with minimal summarized rank via the Cross-Entropy method
inferred← citeshttps://doi.org/10.1214/19-ps333openalex-snapshot
A unified approach for solving sequential selection problems
inferred← citeshttps://doi.org/10.1214/lnms/1215461963openalex-snapshot
Secretary problems as a source of benchmark bounds
inferred← citeshttps://doi.org/10.1214/ss/1177012493openalex-snapshot
Who Solved the Secretary Problem?
inferred← citeshttps://doi.org/10.1287/opre.29.1.130openalex-snapshot
The Secretary Problem with an Unknown Number of Options
inferred← citeshttps://doi.org/10.17863/cam.16222openalex-snapshot
Problems of optimal choice on posets and generalizations of acyclic colourings
inferred← citeshttps://doi.org/10.2307/1402748openalex-snapshot
The Secretary Problem and Its Extensions: A Review
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.427-429.1924openalex-snapshot
Research on the Satisficing Policy of the Secretary Problem
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.