Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Secretary_problem> ?p ?o. }
Showing items 1 to 54 of
54
with 100 items per page.
- Secretary_problem abstract "The secretary problem is one of many names for a famous problem of the optimal stopping theory. The problem has been studied extensively in the fields of applied probability, statistics, and decision theory. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem.The basic form of the problem is the following: imagine an administrator willing to hire the best secretary out of rankable applicants for a position. The applicants are interviewed one-by-one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator can rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants. The question is about the optimal strategy (stopping rule) to maximize the probability of selecting the best applicant. If the decision can be deferred to the end, this can be solved by the simple maximum selection algorithm of tracking the running maximum (and who achieved it), and selecting the overall maximum at the end. The difficulty is that the decision must be made immediately.The problem has an elegant solution. The optimal stopping rule prescribes always rejecting the first applicants after the interview (where e is the base of the natural logarithm) and then stopping at the first applicant who is better than every applicant interviewed so far (or continuing to the last applicant if this never occurs). Sometimes this strategy is called the stopping rule, because the probability of stopping at the best applicant with this strategy is about already for moderate values of . One reason why the secretary problem has received so much attention is that the optimal policy for the problem (the stopping rule) is simple, and selects the single best candidate about 37% of the time, irrespective of whether there are 100 or 100 million applicants. In fact, for any value of the probability of selecting the best candidate when using the optimal policy is at least .".
- Secretary_problem wikiPageExternalLink 1.
- Secretary_problem wikiPageExternalLink Contents.html.
- Secretary_problem wikiPageExternalLink fiche-article-savoir-quand-s-arreter-22670.php.
- Secretary_problem wikiPageExternalLink PostdocProb.pdf.
- Secretary_problem wikiPageExternalLink optimal-search.
- Secretary_problem wikiPageExternalLink Secretary_Problem_Optimizer.
- Secretary_problem wikiPageID "1971750".
- Secretary_problem wikiPageRevisionID "606321793".
- Secretary_problem hasPhotoCollection Secretary_problem.
- Secretary_problem title "Sultan's Dowry Problem".
- Secretary_problem urlname "SultansDowryProblem".
- Secretary_problem subject Category:Decision_theory.
- Secretary_problem subject Category:Named_probability_problems.
- Secretary_problem subject Category:Optimal_decisions.
- Secretary_problem subject Category:Sequential_methods.
- Secretary_problem type Ability105616246.
- Secretary_problem type Abstraction100002137.
- Secretary_problem type Act100030358.
- Secretary_problem type Action100037396.
- Secretary_problem type Attribute100024264.
- Secretary_problem type Choice100161243.
- Secretary_problem type Cognition100023271.
- Secretary_problem type Condition113920835.
- Secretary_problem type Decision100162632.
- Secretary_problem type Difficulty114408086.
- Secretary_problem type Event100029378.
- Secretary_problem type Know-how105616786.
- Secretary_problem type Method105660268.
- Secretary_problem type NamedProbabilityProblems.
- Secretary_problem type OptimalDecisions.
- Secretary_problem type Problem114410605.
- Secretary_problem type PsychologicalFeature100023100.
- Secretary_problem type SequentialMethods.
- Secretary_problem type State100024720.
- Secretary_problem type YagoPermanentlyLocatedEntity.
- Secretary_problem comment "The secretary problem is one of many names for a famous problem of the optimal stopping theory. The problem has been studied extensively in the fields of applied probability, statistics, and decision theory. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem.The basic form of the problem is the following: imagine an administrator willing to hire the best secretary out of rankable applicants for a position.".
- Secretary_problem label "Problem sekretarki".
- Secretary_problem label "Secretaresseprobleem".
- Secretary_problem label "Secretary problem".
- Secretary_problem label "Sekretärinnenproblem".
- Secretary_problem label "Задача о разборчивой невесте".
- Secretary_problem label "秘書問題".
- Secretary_problem label "秘書問題".
- Secretary_problem sameAs Sekretärinnenproblem.
- Secretary_problem sameAs 秘書問題.
- Secretary_problem sameAs Secretaresseprobleem.
- Secretary_problem sameAs Problem_sekretarki.
- Secretary_problem sameAs m.069_gm.
- Secretary_problem sameAs Q1372364.
- Secretary_problem sameAs Q1372364.
- Secretary_problem sameAs Secretary_problem.
- Secretary_problem wasDerivedFrom Secretary_problem?oldid=606321793.
- Secretary_problem isPrimaryTopicOf Secretary_problem.