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

From MaRDI portal
Publication:2525084

DOI10.1007/BF02759948zbMath0149.14402OpenAlexW2002280713MaRDI QIDQ2525084

Herbert Robbins, Sigeiti Moriguti, 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




Related Items

Multi-criteria optimal stopping methods applied to the portfolio optimisation problemExpected duration of the no-information minimum rank problemDynamic programming formulation of the group interview problem with a general utility functionThe Secretary Problem—An UpdateOptimale Rangstrategien in sequentiellen AuswahlprozessenRemarks on the Secretary ProblemWhat is Known About Robbins' Problem?A secretary problem on fuzzy setsUnnamed ItemNASH EQUILIBRIUM IN TWO-SIDED MATE CHOICE PROBLEMGenerelle Nutzenrelationen in Rang-AuswahlprozessenOptimal rules for the sequential selection of uniform spacingsHunting for superstarsA unified approach for solving sequential selection problemsSequential selections with minimization of failureOn an optimal stopping problem of Gusein-ZadeThe secretary problem: optimal selection with interview cost from two groups of candidatesON A multi-person time-sequential game with prioritiesThe secretary problem as a model of choiceGeneralized Sequential Stochastic Assignment ProblemUniformly Bounded Regret in the Multisecretary ProblemAnalysis of heuristic solutions to the best choice problem.The best choice problem for a union of two linear orders with common maximumSecretary problems with inspection costs as a gameHerbert Robbins and sequential analysisA model of finite-step random walk with absorbent boundariesOnline \((J, K)\)-search problem and its competitive analysisThe secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizationsAsymmetric equilibria in dynamic two-sided matching markets with independent preferencesOnline algorithms for the multiple time series search problemAn interactive method for the optimal selection problem with two decision makersOn-line VWAP Trading StrategiesSum the Multiplicative Odds to One and StopA rank-based approach to the sequential selection and assignment problemBuying and selling an asset over the finite time horizon: a non-parametric approachOptimal partitioning of groups in selecting the best choiceMinimax strategies for discounted ?secretary problems? with interview costsA Continuous-Time Approach to Robbins' Problem of Minimizing the Expected RankSelecting the best choice in the weighted secretary problemA nonparametric predictive approach to sequential acceptance problemsOptimal selection problems based on exchangeable trialsPartial-order analogue of the secretary problem: The binary tree caseWhere should you park your car? The $\frac{1}{2}$ ruleA multi-attribute extension of the secretary problem: theory and experimentsSecretary problem with hidden information; searching for a high merit candidateProgressive stopping heuristics that excel in individual and competitive sequential search



Cites Work