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