Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Secretary problem

Known as: 37%25 Rule, Secretary problems, Sultan's dowry problem 
The secretary problem is a famous problem that uses the optimal stopping theory. The problem has been studied extensively in the fields of applied… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of… Expand
Is this relevant?
Highly Cited
2016
Highly Cited
2016
We study generalizations of the ``Prophet Inequality'' and ``Secretary Problem'', where the algorithm is restricted to an… Expand
Is this relevant?
2015
2015
For a number of problems in the theory of online algorithms, it is known that the assumption that elements arrive in uniformly… Expand
Is this relevant?
2015
2015
During the last decade, the matroid secretary problem (MSP) became one of the most prominent classes of online selection problems… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Online auction is the essence of many modern markets, particularly networked markets, in which information about goods, agents… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We examine online matching problems with applications to Internet advertising reservation systems. Consider an edge-weighted… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study a generalization of the classical secretary problem which we call the "matroid secretary problem". In this problem, the… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In the classical secretary problem, a set S of numbers is presented to an online algorithm in random order. At any time the… Expand
Is this relevant?
Review
1989
Review
1989
In Martin Gardner's Mathematical Games column in the February 1960 issue of Scientific American, there appeared a simple problem… Expand
Is this relevant?