On the public citation graph
Generalizing the secretary problem
0 signed · 23 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.1214/aop/1176995775openalex-snapshot
The Infinite Secretary Problem as the Limit of the Finite Problem
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.1007/s00182-025-00922-wopenalex-snapshot
Incentivizing hidden types in secretary problem
inferred← citeshttps://doi.org/10.1007/s40840-022-01436-4openalex-snapshot
A New Method for Computing Asymptotic Results in Optimal Stopping Problems
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90123-6openalex-snapshot
Dynamic programming formulation of the group interview problem with a general utility function
inferred← citeshttps://doi.org/10.1017/s0001867800022382openalex-snapshot
Optimal selection based on relative ranks of a sequence by ties
inferred← citeshttps://doi.org/10.1080/01621459.1985.10478141openalex-snapshot
A Best-Choice Problem With Linear Travel Cost
inferred← citeshttps://doi.org/10.1214/aos/1051027870openalex-snapshot
Herbert Robbins and sequential analysis: invited paper
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.34.3.486openalex-snapshot
A Generalized Problem of Optimal Selection and Assignment
inferred← citeshttps://doi.org/10.1515/9783110883237.1663openalex-snapshot
On certain nonlinear difference and differential equations arising from optimal choice problems
inferred← citeshttps://doi.org/10.15807/jorsj.36.102openalex-snapshot
ASYMPTOTIC THEORY OF SELECTION BY RELATIVE RANK WITH MEDIUM COST
inferred← citeshttps://doi.org/10.15807/jorsj.36.46openalex-snapshot
BASIC THEORY OF SELECTION BY RELATIVE RANK WITH COST
inferred← citeshttps://doi.org/10.2139/ssrn.6396359openalex-snapshot
The Probability of an Event Occurring
inferred← citeshttps://doi.org/10.46787/pump.v2i0.156openalex-snapshot
BitTorrent Protocol and a Modified Secretary 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.