Who solved the secretary problem? With comments and a rejoinder by the author
From MaRDI portal
Publication:1595974
DOI10.1214/ss/1177012493zbMath0955.01509OpenAlexW2085480884WikidataQ56049940 ScholiaQ56049940MaRDI QIDQ1595974
Publication date: 7 February 2001
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/ss/1177012493
Queues and service in operations research (90B22) Development of contemporary mathematics (01A65) Recreational mathematics (00A08)
Related Items (22)
Optimal selection of the four best of a sequence ⋮ An optimal stopping problem with two levels of incomplete information ⋮ Optimal selection of the \(k\) best of a sequence with \(k\) stops ⋮ Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution ⋮ The best choice problem under ambiguity ⋮ The best choice problem with an unknown number of objects ⋮ Hiring Secretaries over Time: The Benefit of Concurrent Employment ⋮ Optimal algorithms for online time series search and one-way trading with interrelated prices ⋮ Competitive weighted matching in transversal matroids ⋮ The Mondee Gills game ⋮ Optimal stopping problems by two or more decision makers: a survey ⋮ On the game of googol ⋮ Analysis and design of selection committees: a game theoretic secretary problem ⋮ Exploration costs as a means for improving performance in multiagent systems ⋮ Hold or roll: reaching the goal in jeopardy race games ⋮ On variants of the matroid secretary problem ⋮ Percolation and best-choice problem for powers of paths ⋮ Minimax strategies for discounted ?secretary problems? with interview costs ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Bayesian stopping rule in discrete parameter space with multiple local maxima ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Where should you park your car? The $\frac{1}{2}$ rule
This page was built for publication: Who solved the secretary problem? With comments and a rejoinder by the author
