The Secretary Problem and Its Extensions: A Review

DOI10.2307/1402748MaRDI QIDQ3664260zbMATH OpenOpenAlexWikidataFDO

Authors Peter R. Freeman

Publication date 1983

Published in International Statistical Review / Revue Internationale de Statistique (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1402748

zbMATH Keywords

bibliographycandidate problemdowry problemdynamic programmingextensionsgoogolhotel problemmarriage problemreviewsecretary problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to probability theory (60-02) History of probability theory (60-03) Stopping times; optimal stopping problems; gambling theory (60G40) Research exposition (monographs, survey articles) pertaining to statistics (62-02) History of statistics (62-03) Optimal stopping in statistics (62L15)

Recommendations

• Who solved the secretary problem? With comments and a rejoinder by the author
• The senior and junior secretaries problem
• scientific article; zbMATH DE number 1061196
• Some Extensions of Generalized Secretary Problem
• scientific article; zbMATH DE number 4033475

Cited in

(only showing first 100 items - show all)

• The full-information best choice problem with a random number of observations
• The secretary problem for a random walk
• Invariant record processes and applications to best choice modelling
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• A secretary problem with restricted offering chances and random number of applications
• Optimal stopping in urn models with payoff depending on maximal observed element
• Selecting the best choice in the weighted secretary problem
• Rank-based selection strategies for the random walk process
• Action-timing problem with sequential Bayesian belief revision process
• Explicit results for a class of asset-selling problems
• Who solved the secretary problem
• Dynamic programming formulation of the group interview problem with a general utility function
• An optimal stopping problem with two levels of incomplete information
• Optimal selection of the \(k\) best of a sequence with \(k\) stops
• Analysis of heuristic solutions to the best choice problem.
• Herbert Robbins and sequential analysis
• Partial-order analogue of the secretary problem: The binary tree case
• Who solved the secretary problem? With comments and a rejoinder by the author
• 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
• Know when to persist: deriving value from a stream buffer
• Opportunity costs in the game of best choice
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
• Selecting the best choice in the full information group interview problem
• The best-choice problem for partially ordered objects.
• Avoiding patterns and making the best choice
• The solution of a generalized secretary problem via analytic expressions
• The secretary problem with multiple job vacancies and batch candidate arrivals
• Counting embeddings of rooted trees into families of rooted trees
• Secretary problem with hidden information; searching for a high merit candidate
• Progressive stopping heuristics that excel in individual and competitive sequential search
• The secretary recommendation problem
• The secretary problem with biased arrival order via a Mallows distribution
• Mate choice when males are in patches: optimal strategies and good rules of thumb
• 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
• A nonparametric predictive approach to sequential acceptance problems
• A new look at the returning secretary problem
• Competitive weighted matching in transversal matroids
• Performance bounds on optimal fixed prices
• A rank-based approach to the sequential selection and assignment problem
• A multi-attribute extension of the secretary problem: theory and experiments
• New results for the \(k\)-secretary problem
• Promoting assets selling through advertisement channels
• Sequential selections with minimization of failure
• Decision Making: A Golden Rule
• Know when to persist: deriving value from a stream buffer (extended abstract)
• Shrinking maxima, decreasing costs: new online packing and covering problems
• The simulated greedy algorithm for several submodular matroid secretary problems
• APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
• Threshold rules for online sample selection
• Improved competitive ratios for submodular secretary problems (extended abstract)
• Multi-attribute sequential decision problem with optimizing and satisficing attributes
• Lending decisions with limits on capital available: the polygamous marriage problem
• Online network design with outliers
• Filling the gap between American and Russian options: adjustable regret
• The Temp Secretary Problem
• The Secretary Problem with a Choice Function
• A full information pricing problem for the sale of several identical commodities
• A model of finite-step random walk with absorbent boundaries
• The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations
• The best choice problem under ambiguity
• scientific article; zbMATH DE number 4031386 (Why is no real title available?)
• scientific article; zbMATH DE number 4033475 (Why is no real title available?)
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• A generalization of the classical secretary problem: dependent arrival sequences
• scientific article; zbMATH DE number 4106644 (Why is no real title available?)
• Sequential games with random priority
• The best choice problem with an unknown number of objects
• Optimal selection of the four best of a sequence
• Markov stopping games with random priority
• The secretary problem: optimal selection with interview cost from two groups of candidates
• The submodular secretary problem goes linear
• Minimax strategies for discounted ?secretary problems? with interview costs
• scientific article; zbMATH DE number 3999700 (Why is no real title available?)
• Some Extensions of Generalized Secretary Problem
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Optimal choice from known rewards with uncertain response
• Maximizing profit with convex costs in the random-order model
• Online resource allocation under partially predictable demand
• Asset selling under debt obligations
• The Secretary Problem—An Update
• OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE
• Generalized sequential stochastic assignment problem
• Uniformly bounded regret in the multisecretary problem
• Weighted games of best choice
• scientific article; zbMATH DE number 7077336 (Why is no real title available?)
• Prophet secretary
• Improved competitive ratio for the matroid secretary problem
• Improved Online Algorithms for Knapsack and GAP in the Random Order Model
• scientific article; zbMATH DE number 7650251 (Why is no real title available?)
• Robust Algorithms for the Secretary Problem
• Recursive Construction of a Nash Equilibrium in a Two-Player Nonzero-Sum Stopping Game with Asymmetric Information
• Buying and selling an asset over the finite time horizon: a non-parametric approach
• Optimal partitioning of groups in selecting the best choice
• Query-based selection of optimal candidates under the Mallows model
• Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
• Conditional evaluations of sums of sample maxima and records

This page was built for publication: The Secretary Problem and Its Extensions: A Review

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664260)