Who solved the secretary problem
From MaRDI portal
Publication:1320411
DOI10.1214/ss/1177012493zbMath0788.90080WikidataQ56049940 ScholiaQ56049940MaRDI QIDQ1320411
Publication date: 20 April 1994
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/ss/1177012493
01A65: Development of contemporary mathematics
90C99: Mathematical programming
00A08: Recreational mathematics
Related Items
Optimal partitioning of groups in selecting the best choice, The best choice problem for posets; colored complete binary trees, Query-based selection of optimal candidates under the Mallows model, Optimal stopping for many connected components in a graph, Simple and fast algorithm for binary integer and online linear programming, Knapsack secretary through boosting, Incentive compatibility in sender-receiver stopping games, Unnamed Item, Decision‐theoretic designs for a series of trials with correlated treatment effects using the Sarmanov multivariate beta‐binomial distribution, The Submodular Secretary Problem Goes Linear, The Value of Information in Some Variations of the Stopping Problem, Sum the Multiplicative Odds to One and Stop, Unnamed Item, Unnamed Item, Online Resource Allocation Under Partially Predictable Demand, The Secretary Problem—An Update, OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE, Average number of candidates surveyed by the headhunter in the recruitment, Unnamed Item, A Framework for the Secretary Problem on the Intersection of Matroids, Uniformly Bounded Regret in the Multisecretary Problem, The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids, Weighted Games of Best Choice, From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path, What is Known About Robbins' Problem?, Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations, Buying and selling an asset over the finite time horizon: a non-parametric approach, Recursive Construction of a Nash Equilibrium in a Two-Player Nonzero-Sum Stopping Game with Asymmetric Information, The simulated greedy algorithm for several submodular matroid secretary problems, Multi-attribute sequential decision problem with optimizing and satisficing attributes, Lending decisions with limits on capital available: the polygamous marriage problem, Competitive analysis of maintaining frequent items of a stream, Strategic disclosure of random variables, Optimal algorithms for the online time series search problem, Optimal composition ordering problems for piecewise linear functions, A loss minimization problem, Optimal stopping in a search for a vertex with full degree in a random graph, Expected duration of the no-information minimum rank problem, When to stop -- a cardinal secretary search experiment, No-information secretary problems with cardinal payoffs and Poisson arrivals, A sequential selection game with vetoes, How much information do we need?, To match or not to match: Aspects of marital matchmaking under uncertainty, Modeling the search for the least costly opportunity, Equilibria of two-sided matching games with common preferences, A secretary problem with restricted offering chances and random number of applications, Selecting the best choice in the weighted secretary problem, Rank-based selection strategies for the random walk process, Explicit results for a class of asset-selling problems, The senior and junior secretaries problem, Dynamic programming formulation of the group interview problem with a general utility function, Analysis of heuristic solutions to the best choice problem., On optimal choosing of one of the \(k\) best objects., Partial-order analogue of the secretary problem: The binary tree case, Characterization of the monotone case for a best choice problem with a random number of objects, Multi-criteria optimal stopping methods applied to the portfolio optimisation problem, Shelf life of candidates in the generalized secretary problem, Know when to persist: deriving value from a stream buffer, Opportunity costs in the game of best choice, The best-or-worst and the postdoc problems, Online algorithms for the multiple time series search problem, The best choice problem for upward directed graphs, Gusein-Zade problem for directed path, Avoiding patterns and making the best choice, Stable secretaries, Full-information best choice game with hint, Secretary markets with local information, A sharp bound for winning within a proportion of the maximum of a sequence, Hold or roll: reaching the goal in jeopardy race games, Secretary problem: graphs, matroids and greedoids, The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy, Counting embeddings of rooted trees into families of rooted trees, A new method for computing asymptotic results in optimal stopping problems, Secretary problem with hidden information; searching for a high merit candidate, Progressive stopping heuristics that excel in individual and competitive sequential search, Parking game, The secretary recommendation problem, The secretary problem with biased arrival order via a Mallows distribution, The multi-returning secretary problem, An optimal double stopping rule for a buying-selling problem, A unified approach for solving sequential selection problems, Robust best choice problem, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Strategy-indifferent games of best choice, Maximizing the expected number of components in an online search of a graph, A new look at the returning secretary problem, The best-or-worst and the postdoc problems with random number of candidates, Increasing threshold search for best-valued agents, The best choice problem for a union of two linear orders with common maximum, An efficient algorithm for stopping on a sink in a directed graph, A game version of the Cowan-Zabczyk-Bruss' problem, A new secretary problem with rank-based selection and cardinal payoffs, Optimal selection problems based on exchangeable trials, A multi-attribute extension of the secretary problem: theory and experiments, Lexicographic ranking and unranking of derangements in cycle notation, New results for the \(k\)-secretary problem, An optimal algorithm for stopping on the element closest to the center of an interval, Prophet inequality with competing agents, Sequential selections with minimization of failure, Running minimum in the best-choice problem, Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings, Know When to Persist: Deriving Value from a Stream Buffer, The secretary problem on an unknown poset, Experimental Analysis of an Online Trading Algorithm, A sharp lower bound for choosing the maximum of an independent sequence, Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract), Maximizing the probability of stopping on any of the last m successes in independent Bernoulli trials with random horizon
