Optimal selection based on relative rank (the 'Secretary Problem')

DOI10.1007/BF02759948zbMath0149.14402OpenAlexW2002280713MaRDI QIDQ2525084

Stephen M. Samuels, Yuan-Shih Chow

Publication date: 1964

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02759948

zbMATH Keywords

statistics

Related Items (46)

Multi-criteria optimal stopping methods applied to the portfolio optimisation problem ⋮ Expected duration of the no-information minimum rank problem ⋮ Dynamic programming formulation of the group interview problem with a general utility function ⋮ The Secretary Problem—An Update ⋮ Optimale Rangstrategien in sequentiellen Auswahlprozessen ⋮ Remarks on the Secretary Problem ⋮ What is Known About Robbins' Problem? ⋮ A secretary problem on fuzzy sets ⋮ Unnamed Item ⋮ NASH EQUILIBRIUM IN TWO-SIDED MATE CHOICE PROBLEM ⋮ Generelle Nutzenrelationen in Rang-Auswahlprozessen ⋮ Optimal rules for the sequential selection of uniform spacings ⋮ Hunting for superstars ⋮ A unified approach for solving sequential selection problems ⋮ Sequential selections with minimization of failure ⋮ On an optimal stopping problem of Gusein-Zade ⋮ The secretary problem: optimal selection with interview cost from two groups of candidates ⋮ ON A multi-person time-sequential game with priorities ⋮ The secretary problem as a model of choice ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ Uniformly Bounded Regret in the Multisecretary Problem ⋮ Analysis of heuristic solutions to the best choice problem. ⋮ The best choice problem for a union of two linear orders with common maximum ⋮ Secretary problems with inspection costs as a game ⋮ Herbert Robbins and sequential analysis ⋮ A model of finite-step random walk with absorbent boundaries ⋮ Online \((J, K)\)-search problem and its competitive analysis ⋮ The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations ⋮ Asymmetric equilibria in dynamic two-sided matching markets with independent preferences ⋮ Online algorithms for the multiple time series search problem ⋮ An interactive method for the optimal selection problem with two decision makers ⋮ On-line VWAP Trading Strategies ⋮ Sum the Multiplicative Odds to One and Stop ⋮ A rank-based approach to the sequential selection and assignment problem ⋮ Buying and selling an asset over the finite time horizon: a non-parametric approach ⋮ Optimal partitioning of groups in selecting the best choice ⋮ Minimax strategies for discounted ?secretary problems? with interview costs ⋮ A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank ⋮ Selecting the best choice in the weighted secretary problem ⋮ A nonparametric predictive approach to sequential acceptance problems ⋮ Optimal selection problems based on exchangeable trials ⋮ Partial-order analogue of the secretary problem: The binary tree case ⋮ Where should you park your car? The $\frac{1}{2}$ rule ⋮ A multi-attribute extension of the secretary problem: theory and experiments ⋮ Secretary problem with hidden information; searching for a high merit candidate ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search

Cites Work

• Dynamic Programming and Decision Theory

This page was built for publication: Optimal selection based on relative rank (the 'Secretary Problem')