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. Let X 1 , ⋯ , X n {\displaystyle X_{1},\cdots ,X_{n}} be independent, identically distributed random variables, uniform on [ 0 , 1 ] {\displaystyle [0,1]} .
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. Let X 1 , ⋯ , X n {\displaystyle X_{1},\cdots ,X_{n}} be independent, identically distributed random variables, uniform on [ 0 , 1 ] {\displaystyle [0,1]} .
Source: Wikipedia "Robbins' problem" · CC BY-SA 4.0
Share this article: X · Bluesky