Robbins' problem
In probability theory, Robbins' problem of optimal stopping, named after Herbert Robbins, is sometimes referred to as the fourth secretary problem or the problem of minimizing the expected rank with full information. Its statement is as follows. Let X1, ... , Xn be independent, identically distributed random variables, uniform on [0, 1]. We observe the Xk's sequentially and must stop on exactly one of them. No recall of preceding observations is permitted. What stopping rule minimizes the expected rank of the selected observation, and what is its corresponding value?
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Robbins' problem
In probability theory, Robbins' problem of optimal stopping, named after Herbert Robbins, is sometimes referred to as the fourth secretary problem or the problem of minimizing the expected rank with full information. Its statement is as follows. Let X1, ... , Xn be independent, identically distributed random variables, uniform on [0, 1]. We observe the Xk's sequentially and must stop on exactly one of them. No recall of preceding observations is permitted. What stopping rule minimizes the expected rank of the selected observation, and what is its corresponding value?
has abstract
In probability theory, Robbins ...... of memoryless threshold rules.
@en
Le problème de Robbins, aussi ...... jusqu'à ce jour encore ouvert.
@fr
Link from a Wikipage to an external page
Wikipage page ID
18,617,781
page length (characters) of wiki page
Wikipage revision ID
961,025,717
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In probability theory, Robbins ...... at is its corresponding value?
@en
Le problème de Robbins, aussi ...... jusqu'à ce jour encore ouvert.
@fr
label
Problème de Robbins
@fr
Robbins' problem
@en