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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We study generalizations of the ``Prophet Inequality'' and ``Secretary Problem'', where the algorithm is restricted to an… (More)
Is this relevant?
2011
2011
In the Matroid Secretary Problem, introduced by Babaioff et al. [5], the elements of a given matroid are presented to an online… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Online auction is the essence of many modern markets, particularly networked markets, in which information about goods, agents… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We examine several online matching problems, with applicat ions to Internet advertising reservation systems. Consider an edge… (More)
  • figure 1
  • figure 2
Is this relevant?
Review
2008
Review
2008
We present generalized secretary problems as a framework for online auctions. Elements, such as potential employees or customers… (More)
Is this relevant?
2008
2008
In the classical secretary problem, the objective is to select the candidate of maximum value among a set of n candidates… (More)
  • table 1
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… (More)
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… (More)
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… (More)
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… (More)
Is this relevant?